./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label47.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label47.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 d039f2d5fa21e99f5f2905e39d510c085a3c5debd52474b0e6ee96280e8d56ea --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:19:37,071 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:19:37,120 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:19:37,125 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:19:37,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:19:37,143 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:19:37,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:19:37,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:19:37,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:19:37,147 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:19:37,148 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:19:37,148 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:19:37,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:19:37,149 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:19:37,149 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:19:37,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:19:37,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:19:37,150 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:19:37,150 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:19:37,150 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:19:37,150 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:19:37,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:19:37,151 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:19:37,151 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:19:37,152 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:19:37,152 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:19:37,152 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:19:37,152 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:19:37,153 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:19:37,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:19:37,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:19:37,153 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:19:37,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:19:37,154 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:19:37,154 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:19:37,154 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:19:37,154 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:19:37,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:19:37,155 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:19:37,155 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:19:37,155 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:19:37,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:19:37,155 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-clean/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-clean/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 -> d039f2d5fa21e99f5f2905e39d510c085a3c5debd52474b0e6ee96280e8d56ea [2024-10-10 23:19:37,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:19:37,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:19:37,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:19:37,417 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:19:37,418 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:19:37,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label47.c [2024-10-10 23:19:38,612 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:19:38,866 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:19:38,867 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label47.c [2024-10-10 23:19:38,879 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cd6db182e/fa84e86883a44297b1ee7810cd4b32f0/FLAG57d758ca0 [2024-10-10 23:19:39,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cd6db182e/fa84e86883a44297b1ee7810cd4b32f0 [2024-10-10 23:19:39,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:19:39,198 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:19:39,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:19:39,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:19:39,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:19:39,204 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,205 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a344ebe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39, skipping insertion in model container [2024-10-10 23:19:39,205 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:19:39,413 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label47.c[5129,5142] [2024-10-10 23:19:39,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:19:39,574 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:19:39,593 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label47.c[5129,5142] [2024-10-10 23:19:39,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:19:39,692 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:19:39,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39 WrapperNode [2024-10-10 23:19:39,693 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:19:39,694 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:19:39,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:19:39,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:19:39,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,722 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,788 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-10-10 23:19:39,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:19:39,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:19:39,789 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:19:39,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:19:39,798 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,810 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,866 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:19:39,866 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,866 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,901 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,910 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,924 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,945 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:19:39,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:19:39,947 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:19:39,948 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:19:39,948 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (1/1) ... [2024-10-10 23:19:39,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:19:39,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:19:39,975 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:19:39,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:19:40,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:19:40,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:19:40,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:19:40,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:19:40,119 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:19:40,121 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:19:41,372 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-10-10 23:19:41,372 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:19:41,406 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:19:41,407 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:19:41,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:19:41 BoogieIcfgContainer [2024-10-10 23:19:41,408 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:19:41,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:19:41,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:19:41,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:19:41,413 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:19:39" (1/3) ... [2024-10-10 23:19:41,413 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646f62f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:19:41, skipping insertion in model container [2024-10-10 23:19:41,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:19:39" (2/3) ... [2024-10-10 23:19:41,414 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646f62f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:19:41, skipping insertion in model container [2024-10-10 23:19:41,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:19:41" (3/3) ... [2024-10-10 23:19:41,415 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label47.c [2024-10-10 23:19:41,428 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:19:41,428 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:19:41,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:19:41,492 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;@d9d1f67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:19:41,493 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:19:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:41,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-10 23:19:41,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:41,505 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] [2024-10-10 23:19:41,505 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:41,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:41,510 INFO L85 PathProgramCache]: Analyzing trace with hash -898511248, now seen corresponding path program 1 times [2024-10-10 23:19:41,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:41,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664665040] [2024-10-10 23:19:41,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:41,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:41,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:41,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:41,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664665040] [2024-10-10 23:19:41,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664665040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:41,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:41,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:19:41,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993444719] [2024-10-10 23:19:41,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:41,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:19:41,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:41,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:19:41,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:19:41,677 INFO L87 Difference]: Start difference. First operand has 221 states, 219 states have (on average 1.917808219178082) internal successors, (420), 220 states have internal predecessors, (420), 0 states have call successors, (0), 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 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:41,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:41,722 INFO L93 Difference]: Finished difference Result 441 states and 839 transitions. [2024-10-10 23:19:41,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:19:41,727 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-10 23:19:41,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:41,734 INFO L225 Difference]: With dead ends: 441 [2024-10-10 23:19:41,734 INFO L226 Difference]: Without dead ends: 219 [2024-10-10 23:19:41,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:19:41,739 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:41,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 355 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:19:41,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-10 23:19:41,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-10-10 23:19:41,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:41,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2024-10-10 23:19:41,776 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 34 [2024-10-10 23:19:41,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:41,776 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2024-10-10 23:19:41,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:41,776 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2024-10-10 23:19:41,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-10 23:19:41,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:41,777 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] [2024-10-10 23:19:41,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:19:41,778 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:41,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:41,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1100766849, now seen corresponding path program 1 times [2024-10-10 23:19:41,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:41,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426180764] [2024-10-10 23:19:41,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:41,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:41,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:41,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:41,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426180764] [2024-10-10 23:19:41,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426180764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:41,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:41,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:19:41,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341206140] [2024-10-10 23:19:41,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:41,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:41,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:41,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:41,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:41,943 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:42,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:42,703 INFO L93 Difference]: Finished difference Result 630 states and 1029 transitions. [2024-10-10 23:19:42,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:42,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-10-10 23:19:42,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:42,707 INFO L225 Difference]: With dead ends: 630 [2024-10-10 23:19:42,707 INFO L226 Difference]: Without dead ends: 412 [2024-10-10 23:19:42,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:42,710 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 173 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:42,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 144 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:19:42,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-10 23:19:42,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 410. [2024-10-10 23:19:42,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 1.4596577017114913) internal successors, (597), 409 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:42,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 597 transitions. [2024-10-10 23:19:42,734 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 597 transitions. Word has length 34 [2024-10-10 23:19:42,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:42,735 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 597 transitions. [2024-10-10 23:19:42,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:42,735 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 597 transitions. [2024-10-10 23:19:42,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-10 23:19:42,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:42,737 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:42,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:19:42,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:42,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:42,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1462515494, now seen corresponding path program 1 times [2024-10-10 23:19:42,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:42,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232252393] [2024-10-10 23:19:42,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:42,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:42,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:42,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232252393] [2024-10-10 23:19:42,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232252393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:42,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:42,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:19:42,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036786572] [2024-10-10 23:19:42,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:42,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:42,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:42,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:42,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:42,880 INFO L87 Difference]: Start difference. First operand 410 states and 597 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:43,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:43,472 INFO L93 Difference]: Finished difference Result 1208 states and 1764 transitions. [2024-10-10 23:19:43,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:43,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2024-10-10 23:19:43,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:43,475 INFO L225 Difference]: With dead ends: 1208 [2024-10-10 23:19:43,475 INFO L226 Difference]: Without dead ends: 799 [2024-10-10 23:19:43,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:43,477 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:43,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 120 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:19:43,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-10-10 23:19:43,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 786. [2024-10-10 23:19:43,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 1.3847133757961783) internal successors, (1087), 785 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:43,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1087 transitions. [2024-10-10 23:19:43,496 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1087 transitions. Word has length 102 [2024-10-10 23:19:43,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:43,497 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1087 transitions. [2024-10-10 23:19:43,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:43,497 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1087 transitions. [2024-10-10 23:19:43,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-10 23:19:43,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:43,499 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:43,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:19:43,500 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:43,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:43,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1894972011, now seen corresponding path program 1 times [2024-10-10 23:19:43,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:43,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39523940] [2024-10-10 23:19:43,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:43,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:43,772 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:43,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:43,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39523940] [2024-10-10 23:19:43,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39523940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:43,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:43,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:19:43,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586811775] [2024-10-10 23:19:43,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:43,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:43,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:43,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:43,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:43,775 INFO L87 Difference]: Start difference. First operand 786 states and 1087 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:44,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:44,325 INFO L93 Difference]: Finished difference Result 1941 states and 2628 transitions. [2024-10-10 23:19:44,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:44,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2024-10-10 23:19:44,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:44,332 INFO L225 Difference]: With dead ends: 1941 [2024-10-10 23:19:44,333 INFO L226 Difference]: Without dead ends: 1156 [2024-10-10 23:19:44,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:44,336 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:44,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 188 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:19:44,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2024-10-10 23:19:44,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1155. [2024-10-10 23:19:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 1154 states have (on average 1.2772963604852687) internal successors, (1474), 1154 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:44,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1474 transitions. [2024-10-10 23:19:44,362 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1474 transitions. Word has length 104 [2024-10-10 23:19:44,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:44,362 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1474 transitions. [2024-10-10 23:19:44,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:44,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1474 transitions. [2024-10-10 23:19:44,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-10 23:19:44,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:44,367 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:44,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:19:44,367 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:44,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:44,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1210140062, now seen corresponding path program 1 times [2024-10-10 23:19:44,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:44,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176903867] [2024-10-10 23:19:44,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:44,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:44,500 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-10 23:19:44,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:44,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176903867] [2024-10-10 23:19:44,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176903867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:44,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:44,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:19:44,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127909922] [2024-10-10 23:19:44,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:44,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:44,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:44,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:44,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:44,505 INFO L87 Difference]: Start difference. First operand 1155 states and 1474 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:45,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:45,106 INFO L93 Difference]: Finished difference Result 2501 states and 3335 transitions. [2024-10-10 23:19:45,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:45,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 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 146 [2024-10-10 23:19:45,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:45,112 INFO L225 Difference]: With dead ends: 2501 [2024-10-10 23:19:45,112 INFO L226 Difference]: Without dead ends: 1531 [2024-10-10 23:19:45,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:45,116 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:45,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 154 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:19:45,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2024-10-10 23:19:45,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1531. [2024-10-10 23:19:45,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 1530 states have (on average 1.261437908496732) internal successors, (1930), 1530 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:45,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1930 transitions. [2024-10-10 23:19:45,137 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1930 transitions. Word has length 146 [2024-10-10 23:19:45,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:45,138 INFO L471 AbstractCegarLoop]: Abstraction has 1531 states and 1930 transitions. [2024-10-10 23:19:45,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:45,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1930 transitions. [2024-10-10 23:19:45,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-10 23:19:45,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:45,143 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:45,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:19:45,144 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:45,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:45,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1448215665, now seen corresponding path program 1 times [2024-10-10 23:19:45,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:45,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946008475] [2024-10-10 23:19:45,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:45,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:45,289 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:45,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:45,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946008475] [2024-10-10 23:19:45,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946008475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:45,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:45,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:45,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670363324] [2024-10-10 23:19:45,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:45,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:19:45,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:45,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:19:45,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:19:45,292 INFO L87 Difference]: Start difference. First operand 1531 states and 1930 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:46,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:46,298 INFO L93 Difference]: Finished difference Result 4930 states and 6391 transitions. [2024-10-10 23:19:46,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:19:46,298 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2024-10-10 23:19:46,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:46,308 INFO L225 Difference]: With dead ends: 4930 [2024-10-10 23:19:46,308 INFO L226 Difference]: Without dead ends: 3584 [2024-10-10 23:19:46,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:19:46,311 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 359 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:46,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 84 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:19:46,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3584 states. [2024-10-10 23:19:46,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3584 to 3583. [2024-10-10 23:19:46,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3583 states, 3582 states have (on average 1.2540480178671134) internal successors, (4492), 3582 states have internal predecessors, (4492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:46,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 4492 transitions. [2024-10-10 23:19:46,360 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 4492 transitions. Word has length 161 [2024-10-10 23:19:46,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:46,360 INFO L471 AbstractCegarLoop]: Abstraction has 3583 states and 4492 transitions. [2024-10-10 23:19:46,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:46,361 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 4492 transitions. [2024-10-10 23:19:46,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-10 23:19:46,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:46,364 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-10 23:19:46,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:19:46,365 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:46,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:46,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1388053774, now seen corresponding path program 1 times [2024-10-10 23:19:46,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:46,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794553310] [2024-10-10 23:19:46,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:46,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:46,580 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-10 23:19:46,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:46,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794553310] [2024-10-10 23:19:46,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794553310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:46,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:46,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:46,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977178123] [2024-10-10 23:19:46,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:46,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:46,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:46,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:46,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:46,583 INFO L87 Difference]: Start difference. First operand 3583 states and 4492 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:47,225 INFO L93 Difference]: Finished difference Result 8097 states and 10365 transitions. [2024-10-10 23:19:47,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:47,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 216 [2024-10-10 23:19:47,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:47,238 INFO L225 Difference]: With dead ends: 8097 [2024-10-10 23:19:47,238 INFO L226 Difference]: Without dead ends: 4883 [2024-10-10 23:19:47,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:47,242 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 162 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:47,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 390 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:19:47,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4883 states. [2024-10-10 23:19:47,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4883 to 4872. [2024-10-10 23:19:47,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4872 states, 4871 states have (on average 1.226236912338329) internal successors, (5973), 4871 states have internal predecessors, (5973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:47,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4872 states to 4872 states and 5973 transitions. [2024-10-10 23:19:47,310 INFO L78 Accepts]: Start accepts. Automaton has 4872 states and 5973 transitions. Word has length 216 [2024-10-10 23:19:47,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:47,310 INFO L471 AbstractCegarLoop]: Abstraction has 4872 states and 5973 transitions. [2024-10-10 23:19:47,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:47,311 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states and 5973 transitions. [2024-10-10 23:19:47,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-10 23:19:47,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:47,313 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:19:47,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:19:47,313 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:47,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:47,314 INFO L85 PathProgramCache]: Analyzing trace with hash -292798307, now seen corresponding path program 1 times [2024-10-10 23:19:47,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:47,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708349278] [2024-10-10 23:19:47,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:47,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:47,497 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-10 23:19:47,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:47,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708349278] [2024-10-10 23:19:47,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708349278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:47,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:47,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:47,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849302045] [2024-10-10 23:19:47,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:47,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:47,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:47,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:47,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:47,500 INFO L87 Difference]: Start difference. First operand 4872 states and 5973 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:48,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:48,062 INFO L93 Difference]: Finished difference Result 11040 states and 13751 transitions. [2024-10-10 23:19:48,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:48,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 222 [2024-10-10 23:19:48,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:48,079 INFO L225 Difference]: With dead ends: 11040 [2024-10-10 23:19:48,079 INFO L226 Difference]: Without dead ends: 6353 [2024-10-10 23:19:48,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:48,084 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 161 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:48,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 388 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:19:48,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6353 states. [2024-10-10 23:19:48,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6353 to 6344. [2024-10-10 23:19:48,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6344 states, 6343 states have (on average 1.2103105785905723) internal successors, (7677), 6343 states have internal predecessors, (7677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:48,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6344 states to 6344 states and 7677 transitions. [2024-10-10 23:19:48,176 INFO L78 Accepts]: Start accepts. Automaton has 6344 states and 7677 transitions. Word has length 222 [2024-10-10 23:19:48,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:48,178 INFO L471 AbstractCegarLoop]: Abstraction has 6344 states and 7677 transitions. [2024-10-10 23:19:48,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:48,178 INFO L276 IsEmpty]: Start isEmpty. Operand 6344 states and 7677 transitions. [2024-10-10 23:19:48,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-10-10 23:19:48,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:48,181 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:19:48,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:19:48,182 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:48,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:48,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1078342311, now seen corresponding path program 1 times [2024-10-10 23:19:48,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:48,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835175819] [2024-10-10 23:19:48,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:48,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:48,679 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:48,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:48,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835175819] [2024-10-10 23:19:48,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835175819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:48,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:48,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-10 23:19:48,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531018564] [2024-10-10 23:19:48,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:48,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 23:19:48,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:48,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 23:19:48,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:19:48,681 INFO L87 Difference]: Start difference. First operand 6344 states and 7677 transitions. Second operand has 6 states, 6 states have (on average 45.833333333333336) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:50,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:50,164 INFO L93 Difference]: Finished difference Result 13286 states and 16078 transitions. [2024-10-10 23:19:50,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 23:19:50,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 45.833333333333336) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 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 275 [2024-10-10 23:19:50,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:50,184 INFO L225 Difference]: With dead ends: 13286 [2024-10-10 23:19:50,184 INFO L226 Difference]: Without dead ends: 7311 [2024-10-10 23:19:50,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-10-10 23:19:50,193 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 474 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 1877 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 2069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 1877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:50,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 186 Invalid, 2069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 1877 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:19:50,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7311 states. [2024-10-10 23:19:50,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7311 to 7265. [2024-10-10 23:19:50,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7265 states, 7264 states have (on average 1.1941079295154184) internal successors, (8674), 7264 states have internal predecessors, (8674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:50,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7265 states to 7265 states and 8674 transitions. [2024-10-10 23:19:50,290 INFO L78 Accepts]: Start accepts. Automaton has 7265 states and 8674 transitions. Word has length 275 [2024-10-10 23:19:50,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:50,291 INFO L471 AbstractCegarLoop]: Abstraction has 7265 states and 8674 transitions. [2024-10-10 23:19:50,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.833333333333336) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:50,291 INFO L276 IsEmpty]: Start isEmpty. Operand 7265 states and 8674 transitions. [2024-10-10 23:19:50,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-10-10 23:19:50,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:50,295 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:19:50,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:19:50,296 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:50,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:50,297 INFO L85 PathProgramCache]: Analyzing trace with hash -137832667, now seen corresponding path program 1 times [2024-10-10 23:19:50,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:50,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417471633] [2024-10-10 23:19:50,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:50,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:50,448 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-10 23:19:50,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:50,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417471633] [2024-10-10 23:19:50,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417471633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:50,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:50,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:50,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606753949] [2024-10-10 23:19:50,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:50,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:50,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:50,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:50,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:50,449 INFO L87 Difference]: Start difference. First operand 7265 states and 8674 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:51,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:51,051 INFO L93 Difference]: Finished difference Result 15628 states and 19054 transitions. [2024-10-10 23:19:51,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:51,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 280 [2024-10-10 23:19:51,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:51,080 INFO L225 Difference]: With dead ends: 15628 [2024-10-10 23:19:51,080 INFO L226 Difference]: Without dead ends: 9471 [2024-10-10 23:19:51,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:51,090 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 192 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:51,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 321 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:19:51,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9471 states. [2024-10-10 23:19:51,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9471 to 9102. [2024-10-10 23:19:51,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9102 states, 9101 states have (on average 1.199978024392924) internal successors, (10921), 9101 states have internal predecessors, (10921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9102 states to 9102 states and 10921 transitions. [2024-10-10 23:19:51,198 INFO L78 Accepts]: Start accepts. Automaton has 9102 states and 10921 transitions. Word has length 280 [2024-10-10 23:19:51,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:51,198 INFO L471 AbstractCegarLoop]: Abstraction has 9102 states and 10921 transitions. [2024-10-10 23:19:51,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:51,202 INFO L276 IsEmpty]: Start isEmpty. Operand 9102 states and 10921 transitions. [2024-10-10 23:19:51,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-10-10 23:19:51,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:51,208 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:51,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:19:51,208 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:51,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:51,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1143042974, now seen corresponding path program 1 times [2024-10-10 23:19:51,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:51,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310452067] [2024-10-10 23:19:51,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:51,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:51,349 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-10-10 23:19:51,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:51,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310452067] [2024-10-10 23:19:51,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310452067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:51,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:51,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:51,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217628409] [2024-10-10 23:19:51,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:51,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:51,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:51,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:51,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:51,351 INFO L87 Difference]: Start difference. First operand 9102 states and 10921 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:51,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:51,901 INFO L93 Difference]: Finished difference Result 18751 states and 22846 transitions. [2024-10-10 23:19:51,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:51,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 299 [2024-10-10 23:19:51,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:51,917 INFO L225 Difference]: With dead ends: 18751 [2024-10-10 23:19:51,917 INFO L226 Difference]: Without dead ends: 10757 [2024-10-10 23:19:51,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:51,926 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 188 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:51,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 146 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:19:51,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10757 states. [2024-10-10 23:19:51,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10757 to 9831. [2024-10-10 23:19:52,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9831 states, 9830 states have (on average 1.1803662258392675) internal successors, (11603), 9830 states have internal predecessors, (11603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:52,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9831 states to 9831 states and 11603 transitions. [2024-10-10 23:19:52,064 INFO L78 Accepts]: Start accepts. Automaton has 9831 states and 11603 transitions. Word has length 299 [2024-10-10 23:19:52,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:52,064 INFO L471 AbstractCegarLoop]: Abstraction has 9831 states and 11603 transitions. [2024-10-10 23:19:52,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:52,065 INFO L276 IsEmpty]: Start isEmpty. Operand 9831 states and 11603 transitions. [2024-10-10 23:19:52,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-10-10 23:19:52,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:52,073 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:52,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:19:52,073 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:52,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:52,074 INFO L85 PathProgramCache]: Analyzing trace with hash 494304059, now seen corresponding path program 1 times [2024-10-10 23:19:52,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:52,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098652586] [2024-10-10 23:19:52,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:52,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:52,437 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:19:52,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:52,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098652586] [2024-10-10 23:19:52,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098652586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:52,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:52,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:19:52,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029308458] [2024-10-10 23:19:52,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:52,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:19:52,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:52,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:19:52,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:19:52,440 INFO L87 Difference]: Start difference. First operand 9831 states and 11603 transitions. Second operand has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:53,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:53,505 INFO L93 Difference]: Finished difference Result 23913 states and 28683 transitions. [2024-10-10 23:19:53,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:19:53,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 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 339 [2024-10-10 23:19:53,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:53,528 INFO L225 Difference]: With dead ends: 23913 [2024-10-10 23:19:53,528 INFO L226 Difference]: Without dead ends: 15190 [2024-10-10 23:19:53,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:19:53,538 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 255 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1109 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:53,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 65 Invalid, 1420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1109 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:19:53,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15190 states. [2024-10-10 23:19:53,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15190 to 13515. [2024-10-10 23:19:53,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13515 states, 13514 states have (on average 1.185955305608998) internal successors, (16027), 13514 states have internal predecessors, (16027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:53,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13515 states to 13515 states and 16027 transitions. [2024-10-10 23:19:53,690 INFO L78 Accepts]: Start accepts. Automaton has 13515 states and 16027 transitions. Word has length 339 [2024-10-10 23:19:53,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:53,690 INFO L471 AbstractCegarLoop]: Abstraction has 13515 states and 16027 transitions. [2024-10-10 23:19:53,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:53,691 INFO L276 IsEmpty]: Start isEmpty. Operand 13515 states and 16027 transitions. [2024-10-10 23:19:53,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2024-10-10 23:19:53,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:53,756 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:53,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:19:53,757 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:53,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:53,757 INFO L85 PathProgramCache]: Analyzing trace with hash -116809329, now seen corresponding path program 1 times [2024-10-10 23:19:53,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:53,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373746510] [2024-10-10 23:19:53,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:53,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:54,085 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-10 23:19:54,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:54,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373746510] [2024-10-10 23:19:54,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373746510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:54,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:54,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:19:54,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496965699] [2024-10-10 23:19:54,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:54,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:19:54,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:54,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:19:54,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:19:54,087 INFO L87 Difference]: Start difference. First operand 13515 states and 16027 transitions. Second operand has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:55,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:55,193 INFO L93 Difference]: Finished difference Result 29621 states and 35605 transitions. [2024-10-10 23:19:55,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:19:55,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 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 413 [2024-10-10 23:19:55,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:55,217 INFO L225 Difference]: With dead ends: 29621 [2024-10-10 23:19:55,217 INFO L226 Difference]: Without dead ends: 17214 [2024-10-10 23:19:55,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:19:55,231 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 254 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:55,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 65 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:19:55,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17214 states. [2024-10-10 23:19:55,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17214 to 13147. [2024-10-10 23:19:55,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13147 states, 13146 states have (on average 1.1870530959987828) internal successors, (15605), 13146 states have internal predecessors, (15605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:55,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13147 states to 13147 states and 15605 transitions. [2024-10-10 23:19:55,376 INFO L78 Accepts]: Start accepts. Automaton has 13147 states and 15605 transitions. Word has length 413 [2024-10-10 23:19:55,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:55,377 INFO L471 AbstractCegarLoop]: Abstraction has 13147 states and 15605 transitions. [2024-10-10 23:19:55,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:55,377 INFO L276 IsEmpty]: Start isEmpty. Operand 13147 states and 15605 transitions. [2024-10-10 23:19:55,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2024-10-10 23:19:55,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:55,394 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:55,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:19:55,395 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:55,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:55,395 INFO L85 PathProgramCache]: Analyzing trace with hash 630205162, now seen corresponding path program 1 times [2024-10-10 23:19:55,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:55,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889892869] [2024-10-10 23:19:55,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:55,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:55,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 802 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2024-10-10 23:19:55,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:55,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889892869] [2024-10-10 23:19:55,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889892869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:55,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:55,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:55,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59415191] [2024-10-10 23:19:55,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:55,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:55,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:55,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:55,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:55,629 INFO L87 Difference]: Start difference. First operand 13147 states and 15605 transitions. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:56,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:56,157 INFO L93 Difference]: Finished difference Result 23892 states and 28434 transitions. [2024-10-10 23:19:56,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:56,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 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 586 [2024-10-10 23:19:56,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:56,174 INFO L225 Difference]: With dead ends: 23892 [2024-10-10 23:19:56,174 INFO L226 Difference]: Without dead ends: 11853 [2024-10-10 23:19:56,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:56,186 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 101 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:56,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 147 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:19:56,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11853 states. [2024-10-10 23:19:56,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11853 to 10011. [2024-10-10 23:19:56,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10011 states, 10010 states have (on average 1.1403596403596403) internal successors, (11415), 10010 states have internal predecessors, (11415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:56,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10011 states to 10011 states and 11415 transitions. [2024-10-10 23:19:56,352 INFO L78 Accepts]: Start accepts. Automaton has 10011 states and 11415 transitions. Word has length 586 [2024-10-10 23:19:56,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:56,353 INFO L471 AbstractCegarLoop]: Abstraction has 10011 states and 11415 transitions. [2024-10-10 23:19:56,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:56,353 INFO L276 IsEmpty]: Start isEmpty. Operand 10011 states and 11415 transitions. [2024-10-10 23:19:56,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 678 [2024-10-10 23:19:56,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:19:56,370 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:56,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 23:19:56,371 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:19:56,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:19:56,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1764693411, now seen corresponding path program 1 times [2024-10-10 23:19:56,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:19:56,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996507716] [2024-10-10 23:19:56,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:19:56,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:19:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:19:56,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 713 proven. 0 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2024-10-10 23:19:56,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:19:56,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996507716] [2024-10-10 23:19:56,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996507716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:19:56,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:19:56,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:19:56,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053282720] [2024-10-10 23:19:56,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:19:56,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:19:56,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:19:56,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:19:56,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:56,710 INFO L87 Difference]: Start difference. First operand 10011 states and 11415 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:57,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:19:57,255 INFO L93 Difference]: Finished difference Result 20200 states and 23128 transitions. [2024-10-10 23:19:57,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:19:57,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 677 [2024-10-10 23:19:57,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:19:57,257 INFO L225 Difference]: With dead ends: 20200 [2024-10-10 23:19:57,257 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:19:57,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:19:57,267 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 194 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:19:57,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 362 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:19:57,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:19:57,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:19:57,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:19:57,268 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 677 [2024-10-10 23:19:57,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:19:57,268 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:19:57,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:19:57,268 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:19:57,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:19:57,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:19:57,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:19:57,274 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:19:57,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:19:58,055 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:19:58,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:19:58 BoogieIcfgContainer [2024-10-10 23:19:58,067 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:19:58,067 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:19:58,068 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:19:58,068 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:19:58,068 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:19:41" (3/4) ... [2024-10-10 23:19:58,070 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:19:58,085 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:19:58,086 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:19:58,087 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:19:58,088 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:19:58,216 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:19:58,216 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:19:58,216 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:19:58,217 INFO L158 Benchmark]: Toolchain (without parser) took 19018.38ms. Allocated memory was 157.3MB in the beginning and 738.2MB in the end (delta: 580.9MB). Free memory was 124.2MB in the beginning and 549.5MB in the end (delta: -425.3MB). Peak memory consumption was 155.0MB. Max. memory is 16.1GB. [2024-10-10 23:19:58,217 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory was 76.4MB in the beginning and 76.2MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:19:58,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 493.55ms. Allocated memory is still 157.3MB. Free memory was 124.2MB in the beginning and 76.4MB in the end (delta: 47.8MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-10-10 23:19:58,218 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.05ms. Allocated memory is still 157.3MB. Free memory was 75.4MB in the beginning and 58.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-10 23:19:58,218 INFO L158 Benchmark]: Boogie Preprocessor took 156.91ms. Allocated memory is still 157.3MB. Free memory was 58.6MB in the beginning and 110.9MB in the end (delta: -52.3MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2024-10-10 23:19:58,218 INFO L158 Benchmark]: RCFGBuilder took 1461.05ms. Allocated memory was 157.3MB in the beginning and 211.8MB in the end (delta: 54.5MB). Free memory was 110.9MB in the beginning and 125.9MB in the end (delta: -15.0MB). Peak memory consumption was 81.5MB. Max. memory is 16.1GB. [2024-10-10 23:19:58,218 INFO L158 Benchmark]: TraceAbstraction took 16657.14ms. Allocated memory was 211.8MB in the beginning and 738.2MB in the end (delta: 526.4MB). Free memory was 124.8MB in the beginning and 566.3MB in the end (delta: -441.4MB). Peak memory consumption was 501.3MB. Max. memory is 16.1GB. [2024-10-10 23:19:58,219 INFO L158 Benchmark]: Witness Printer took 148.89ms. Allocated memory is still 738.2MB. Free memory was 566.3MB in the beginning and 549.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-10 23:19:58,220 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory was 76.4MB in the beginning and 76.2MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 493.55ms. Allocated memory is still 157.3MB. Free memory was 124.2MB in the beginning and 76.4MB in the end (delta: 47.8MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.05ms. Allocated memory is still 157.3MB. Free memory was 75.4MB in the beginning and 58.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 156.91ms. Allocated memory is still 157.3MB. Free memory was 58.6MB in the beginning and 110.9MB in the end (delta: -52.3MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1461.05ms. Allocated memory was 157.3MB in the beginning and 211.8MB in the end (delta: 54.5MB). Free memory was 110.9MB in the beginning and 125.9MB in the end (delta: -15.0MB). Peak memory consumption was 81.5MB. Max. memory is 16.1GB. * TraceAbstraction took 16657.14ms. Allocated memory was 211.8MB in the beginning and 738.2MB in the end (delta: 526.4MB). Free memory was 124.8MB in the beginning and 566.3MB in the end (delta: -441.4MB). Peak memory consumption was 501.3MB. Max. memory is 16.1GB. * Witness Printer took 148.89ms. Allocated memory is still 738.2MB. Free memory was 566.3MB in the beginning and 549.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 121]: 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, 221 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.8s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2882 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2882 mSDsluCounter, 3115 SdHoareTripleChecker+Invalid, 8.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 402 mSDsCounter, 1944 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10587 IncrementalHoareTripleChecker+Invalid, 12531 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1944 mSolverCounterUnsat, 2713 mSDtfsCounter, 10587 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13515occurred in iteration=12, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 8962 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 3888 NumberOfCodeBlocks, 3888 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3873 ConstructedInterpolants, 0 QuantifiedInterpolants, 10093 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 3952/3952 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: 1044]: Loop Invariant Derived loop invariant: (((((((((a29 <= 599998) && (a4 != 1)) || (((a25 <= 10) && (a29 <= 599999)) && (((long long) a23 + 599772) <= 0))) || (((long long) a29 + 21) <= 0)) || ((((307 <= a23) && (a25 == 11)) && (a29 <= 599999)) && (a4 == 1))) || ((a25 == 11) && (a29 <= 599998))) || ((a25 == 13) && (a29 <= 599998))) || ((307 <= a23) && (a29 <= 599998))) || (((a25 <= 10) && (a29 <= 599999)) && (a4 == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:19:58,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE