./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label27.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label27.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7c6f0a8bc653ee68bba5d1e7193079f2216382bf70b295e228b301f341587f5f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:22:23,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:22:23,976 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:22:23,982 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:22:23,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:22:24,010 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:22:24,011 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:22:24,012 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:22:24,012 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:22:24,015 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:22:24,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:22:24,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:22:24,016 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:22:24,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:22:24,016 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:22:24,017 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:22:24,017 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:22:24,017 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:22:24,019 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:22:24,019 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:22:24,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:22:24,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:22:24,020 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:22:24,020 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:22:24,020 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:22:24,020 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:22:24,020 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:22:24,021 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:22:24,021 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:22:24,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:22:24,021 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:22:24,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:22:24,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:22:24,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:22:24,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:22:24,034 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:22:24,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:22:24,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:22:24,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:22:24,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:22:24,035 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:22:24,035 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:22:24,036 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7c6f0a8bc653ee68bba5d1e7193079f2216382bf70b295e228b301f341587f5f [2024-11-09 19:22:24,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:22:24,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:22:24,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:22:24,301 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:22:24,302 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:22:24,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label27.c [2024-11-09 19:22:25,602 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:22:25,849 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:22:25,854 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label27.c [2024-11-09 19:22:25,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/688a26112/177536eab0cb432aafa7f558431debcc/FLAGb57ccbc03 [2024-11-09 19:22:25,886 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/688a26112/177536eab0cb432aafa7f558431debcc [2024-11-09 19:22:25,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:22:25,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:22:25,891 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:22:25,891 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:22:25,896 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:22:25,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:22:25" (1/1) ... [2024-11-09 19:22:25,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62629bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:25, skipping insertion in model container [2024-11-09 19:22:25,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:22:25" (1/1) ... [2024-11-09 19:22:25,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:22:26,119 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label27.c[6152,6165] [2024-11-09 19:22:26,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:22:26,282 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:22:26,299 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label27.c[6152,6165] [2024-11-09 19:22:26,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:22:26,382 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:22:26,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:26 WrapperNode [2024-11-09 19:22:26,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:22:26,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:22:26,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:22:26,387 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:22:26,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:26" (1/1) ... [2024-11-09 19:22:26,421 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:26" (1/1) ... [2024-11-09 19:22:26,528 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 999 [2024-11-09 19:22:26,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:22:26,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:22:26,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:22:26,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:22:26,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:26" (1/1) ... [2024-11-09 19:22:26,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:26" (1/1) ... [2024-11-09 19:22:26,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:26" (1/1) ... [2024-11-09 19:22:26,627 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 19:22:26,631 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:26" (1/1) ... [2024-11-09 19:22:26,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:26" (1/1) ... [2024-11-09 19:22:26,662 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:26" (1/1) ... [2024-11-09 19:22:26,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:26" (1/1) ... [2024-11-09 19:22:26,674 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:26" (1/1) ... [2024-11-09 19:22:26,678 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:26" (1/1) ... [2024-11-09 19:22:26,687 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:22:26,688 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:22:26,689 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:22:26,689 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:22:26,690 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:26" (1/1) ... [2024-11-09 19:22:26,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:22:26,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:22:26,724 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 19:22:26,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 19:22:26,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:22:26,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:22:26,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:22:26,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:22:26,818 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:22:26,820 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:22:28,213 INFO L? ?]: Removed 248 outVars from TransFormulas that were not future-live. [2024-11-09 19:22:28,214 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:22:28,238 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:22:28,241 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:22:28,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:22:28 BoogieIcfgContainer [2024-11-09 19:22:28,241 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:22:28,243 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:22:28,244 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:22:28,247 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:22:28,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:22:25" (1/3) ... [2024-11-09 19:22:28,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e07f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:22:28, skipping insertion in model container [2024-11-09 19:22:28,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:22:26" (2/3) ... [2024-11-09 19:22:28,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24e07f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:22:28, skipping insertion in model container [2024-11-09 19:22:28,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:22:28" (3/3) ... [2024-11-09 19:22:28,250 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label27.c [2024-11-09 19:22:28,265 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:22:28,265 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:22:28,331 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:22:28,341 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;@7d980417, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:22:28,342 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:22:28,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 286 states, 284 states have (on average 2.1267605633802815) internal successors, (604), 285 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:28,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 19:22:28,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:28,356 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:28,356 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:28,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:28,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1909484738, now seen corresponding path program 1 times [2024-11-09 19:22:28,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:28,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489686378] [2024-11-09 19:22:28,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:28,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:28,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:28,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:28,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489686378] [2024-11-09 19:22:28,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489686378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:28,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:28,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:22:28,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780090827] [2024-11-09 19:22:28,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:28,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:28,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:28,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:28,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:28,712 INFO L87 Difference]: Start difference. First operand has 286 states, 284 states have (on average 2.1267605633802815) internal successors, (604), 285 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:29,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:29,786 INFO L93 Difference]: Finished difference Result 767 states and 1708 transitions. [2024-11-09 19:22:29,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:29,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2024-11-09 19:22:29,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:29,798 INFO L225 Difference]: With dead ends: 767 [2024-11-09 19:22:29,798 INFO L226 Difference]: Without dead ends: 416 [2024-11-09 19:22:29,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:29,804 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 305 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:29,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 227 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 19:22:29,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-09 19:22:29,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2024-11-09 19:22:29,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 2.0240963855421685) internal successors, (840), 415 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:29,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 840 transitions. [2024-11-09 19:22:29,851 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 840 transitions. Word has length 44 [2024-11-09 19:22:29,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:29,852 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 840 transitions. [2024-11-09 19:22:29,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:29,852 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 840 transitions. [2024-11-09 19:22:29,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 19:22:29,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:29,855 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:29,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:22:29,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:29,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:29,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1385537240, now seen corresponding path program 1 times [2024-11-09 19:22:29,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:29,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222766337] [2024-11-09 19:22:29,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:29,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:30,018 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:30,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:30,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222766337] [2024-11-09 19:22:30,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222766337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:30,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:30,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:22:30,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406819917] [2024-11-09 19:22:30,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:30,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:30,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:30,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:30,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:30,023 INFO L87 Difference]: Start difference. First operand 416 states and 840 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:30,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:30,846 INFO L93 Difference]: Finished difference Result 1219 states and 2485 transitions. [2024-11-09 19:22:30,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:30,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-11-09 19:22:30,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:30,853 INFO L225 Difference]: With dead ends: 1219 [2024-11-09 19:22:30,854 INFO L226 Difference]: Without dead ends: 805 [2024-11-09 19:22:30,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:30,856 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 261 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:30,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 125 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:22:30,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2024-11-09 19:22:30,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 794. [2024-11-09 19:22:30,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 793 states have (on average 1.9722572509457756) internal successors, (1564), 793 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1564 transitions. [2024-11-09 19:22:30,894 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1564 transitions. Word has length 113 [2024-11-09 19:22:30,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:30,894 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1564 transitions. [2024-11-09 19:22:30,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 2 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:30,894 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1564 transitions. [2024-11-09 19:22:30,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 19:22:30,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:30,896 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:30,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:22:30,897 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:30,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:30,901 INFO L85 PathProgramCache]: Analyzing trace with hash 967663394, now seen corresponding path program 1 times [2024-11-09 19:22:30,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:30,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085395800] [2024-11-09 19:22:30,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:30,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:31,135 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:31,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:31,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085395800] [2024-11-09 19:22:31,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085395800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:31,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:31,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:22:31,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009131235] [2024-11-09 19:22:31,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:31,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:31,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:31,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:31,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:31,137 INFO L87 Difference]: Start difference. First operand 794 states and 1564 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-11-09 19:22:32,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:32,032 INFO L93 Difference]: Finished difference Result 2328 states and 4623 transitions. [2024-11-09 19:22:32,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:32,033 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 115 [2024-11-09 19:22:32,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:32,042 INFO L225 Difference]: With dead ends: 2328 [2024-11-09 19:22:32,042 INFO L226 Difference]: Without dead ends: 1536 [2024-11-09 19:22:32,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:32,049 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 238 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:32,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 197 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:22:32,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2024-11-09 19:22:32,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1535. [2024-11-09 19:22:32,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1534 states have (on average 1.8363754889178618) internal successors, (2817), 1534 states have internal predecessors, (2817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:32,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2817 transitions. [2024-11-09 19:22:32,082 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2817 transitions. Word has length 115 [2024-11-09 19:22:32,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:32,083 INFO L471 AbstractCegarLoop]: Abstraction has 1535 states and 2817 transitions. [2024-11-09 19:22:32,083 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-11-09 19:22:32,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2817 transitions. [2024-11-09 19:22:32,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-09 19:22:32,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:32,091 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:32,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:22:32,092 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:32,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:32,092 INFO L85 PathProgramCache]: Analyzing trace with hash -57209967, now seen corresponding path program 1 times [2024-11-09 19:22:32,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:32,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712049216] [2024-11-09 19:22:32,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:32,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:32,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:32,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712049216] [2024-11-09 19:22:32,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712049216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:32,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:32,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:32,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394464332] [2024-11-09 19:22:32,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:32,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:32,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:32,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:32,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:32,321 INFO L87 Difference]: Start difference. First operand 1535 states and 2817 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:33,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:33,070 INFO L93 Difference]: Finished difference Result 3276 states and 6165 transitions. [2024-11-09 19:22:33,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:33,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2024-11-09 19:22:33,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:33,077 INFO L225 Difference]: With dead ends: 3276 [2024-11-09 19:22:33,077 INFO L226 Difference]: Without dead ends: 1928 [2024-11-09 19:22:33,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:33,080 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 312 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:33,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 446 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:22:33,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2024-11-09 19:22:33,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1925. [2024-11-09 19:22:33,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1924 states have (on average 1.8633056133056134) internal successors, (3585), 1924 states have internal predecessors, (3585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:33,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 3585 transitions. [2024-11-09 19:22:33,109 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 3585 transitions. Word has length 172 [2024-11-09 19:22:33,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:33,109 INFO L471 AbstractCegarLoop]: Abstraction has 1925 states and 3585 transitions. [2024-11-09 19:22:33,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:33,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 3585 transitions. [2024-11-09 19:22:33,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-09 19:22:33,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:33,112 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:22:33,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:22:33,113 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:33,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:33,113 INFO L85 PathProgramCache]: Analyzing trace with hash -438227574, now seen corresponding path program 1 times [2024-11-09 19:22:33,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:33,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739185129] [2024-11-09 19:22:33,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:33,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-09 19:22:33,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:33,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739185129] [2024-11-09 19:22:33,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739185129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:33,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:33,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:33,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195811341] [2024-11-09 19:22:33,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:33,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:33,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:33,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:33,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:33,351 INFO L87 Difference]: Start difference. First operand 1925 states and 3585 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:34,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:34,210 INFO L93 Difference]: Finished difference Result 4414 states and 8352 transitions. [2024-11-09 19:22:34,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:34,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 228 [2024-11-09 19:22:34,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:34,223 INFO L225 Difference]: With dead ends: 4414 [2024-11-09 19:22:34,224 INFO L226 Difference]: Without dead ends: 2676 [2024-11-09 19:22:34,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:34,227 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 274 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:34,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 516 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:22:34,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2676 states. [2024-11-09 19:22:34,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2676 to 2481. [2024-11-09 19:22:34,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2481 states, 2480 states have (on average 1.857258064516129) internal successors, (4606), 2480 states have internal predecessors, (4606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:34,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 4606 transitions. [2024-11-09 19:22:34,276 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 4606 transitions. Word has length 228 [2024-11-09 19:22:34,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:34,276 INFO L471 AbstractCegarLoop]: Abstraction has 2481 states and 4606 transitions. [2024-11-09 19:22:34,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:34,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 4606 transitions. [2024-11-09 19:22:34,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-09 19:22:34,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:34,280 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:22:34,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:22:34,281 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:34,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:34,281 INFO L85 PathProgramCache]: Analyzing trace with hash -167294600, now seen corresponding path program 1 times [2024-11-09 19:22:34,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:34,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545453398] [2024-11-09 19:22:34,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:34,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:34,471 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 19:22:34,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:34,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545453398] [2024-11-09 19:22:34,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545453398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:34,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:34,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:34,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793533981] [2024-11-09 19:22:34,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:34,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:34,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:34,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:34,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:34,474 INFO L87 Difference]: Start difference. First operand 2481 states and 4606 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:35,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:35,356 INFO L93 Difference]: Finished difference Result 5895 states and 11019 transitions. [2024-11-09 19:22:35,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:35,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 234 [2024-11-09 19:22:35,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:35,371 INFO L225 Difference]: With dead ends: 5895 [2024-11-09 19:22:35,372 INFO L226 Difference]: Without dead ends: 3416 [2024-11-09 19:22:35,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:35,377 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 273 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:35,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 514 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 19:22:35,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2024-11-09 19:22:35,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 3407. [2024-11-09 19:22:35,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3407 states, 3406 states have (on average 1.835584263065179) internal successors, (6252), 3406 states have internal predecessors, (6252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:35,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3407 states to 3407 states and 6252 transitions. [2024-11-09 19:22:35,430 INFO L78 Accepts]: Start accepts. Automaton has 3407 states and 6252 transitions. Word has length 234 [2024-11-09 19:22:35,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:35,431 INFO L471 AbstractCegarLoop]: Abstraction has 3407 states and 6252 transitions. [2024-11-09 19:22:35,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:35,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3407 states and 6252 transitions. [2024-11-09 19:22:35,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-11-09 19:22:35,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:35,436 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:35,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:22:35,436 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:35,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:35,437 INFO L85 PathProgramCache]: Analyzing trace with hash 246737218, now seen corresponding path program 1 times [2024-11-09 19:22:35,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:35,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2218713] [2024-11-09 19:22:35,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:35,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:35,713 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-09 19:22:35,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:35,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2218713] [2024-11-09 19:22:35,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2218713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:35,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:35,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:35,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128610081] [2024-11-09 19:22:35,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:35,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:35,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:35,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:35,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:35,715 INFO L87 Difference]: Start difference. First operand 3407 states and 6252 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:36,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:36,482 INFO L93 Difference]: Finished difference Result 6826 states and 12527 transitions. [2024-11-09 19:22:36,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:36,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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 306 [2024-11-09 19:22:36,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:36,496 INFO L225 Difference]: With dead ends: 6826 [2024-11-09 19:22:36,497 INFO L226 Difference]: Without dead ends: 3421 [2024-11-09 19:22:36,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:36,501 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 257 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:36,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 459 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 786 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:22:36,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3421 states. [2024-11-09 19:22:36,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3421 to 3037. [2024-11-09 19:22:36,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3037 states, 3036 states have (on average 1.8076416337285903) internal successors, (5488), 3036 states have internal predecessors, (5488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:36,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3037 states to 3037 states and 5488 transitions. [2024-11-09 19:22:36,548 INFO L78 Accepts]: Start accepts. Automaton has 3037 states and 5488 transitions. Word has length 306 [2024-11-09 19:22:36,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:36,548 INFO L471 AbstractCegarLoop]: Abstraction has 3037 states and 5488 transitions. [2024-11-09 19:22:36,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:36,549 INFO L276 IsEmpty]: Start isEmpty. Operand 3037 states and 5488 transitions. [2024-11-09 19:22:36,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-11-09 19:22:36,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:36,553 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:36,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:22:36,553 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:36,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:36,554 INFO L85 PathProgramCache]: Analyzing trace with hash 700320540, now seen corresponding path program 1 times [2024-11-09 19:22:36,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:36,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342283031] [2024-11-09 19:22:36,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:36,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:36,741 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-09 19:22:36,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:36,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342283031] [2024-11-09 19:22:36,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342283031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:36,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:36,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:36,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385538219] [2024-11-09 19:22:36,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:36,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:36,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:36,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:36,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:36,744 INFO L87 Difference]: Start difference. First operand 3037 states and 5488 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:37,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:37,459 INFO L93 Difference]: Finished difference Result 6049 states and 10941 transitions. [2024-11-09 19:22:37,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:37,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 307 [2024-11-09 19:22:37,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:37,469 INFO L225 Difference]: With dead ends: 6049 [2024-11-09 19:22:37,469 INFO L226 Difference]: Without dead ends: 3014 [2024-11-09 19:22:37,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:37,474 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 281 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:37,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 152 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 19:22:37,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2024-11-09 19:22:37,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 3012. [2024-11-09 19:22:37,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3012 states, 3011 states have (on average 1.764530056459648) internal successors, (5313), 3011 states have internal predecessors, (5313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:37,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3012 states to 3012 states and 5313 transitions. [2024-11-09 19:22:37,518 INFO L78 Accepts]: Start accepts. Automaton has 3012 states and 5313 transitions. Word has length 307 [2024-11-09 19:22:37,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:37,519 INFO L471 AbstractCegarLoop]: Abstraction has 3012 states and 5313 transitions. [2024-11-09 19:22:37,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:37,519 INFO L276 IsEmpty]: Start isEmpty. Operand 3012 states and 5313 transitions. [2024-11-09 19:22:37,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-11-09 19:22:37,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:37,523 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2024-11-09 19:22:37,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:22:37,524 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:37,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:37,524 INFO L85 PathProgramCache]: Analyzing trace with hash -728400, now seen corresponding path program 1 times [2024-11-09 19:22:37,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:37,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707555748] [2024-11-09 19:22:37,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:37,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:37,758 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-11-09 19:22:37,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:37,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707555748] [2024-11-09 19:22:37,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707555748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:37,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:37,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:37,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141140332] [2024-11-09 19:22:37,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:37,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:37,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:37,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:37,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:37,761 INFO L87 Difference]: Start difference. First operand 3012 states and 5313 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:38,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:38,440 INFO L93 Difference]: Finished difference Result 6946 states and 12252 transitions. [2024-11-09 19:22:38,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:38,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 312 [2024-11-09 19:22:38,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:38,458 INFO L225 Difference]: With dead ends: 6946 [2024-11-09 19:22:38,458 INFO L226 Difference]: Without dead ends: 3936 [2024-11-09 19:22:38,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:38,465 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 299 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:38,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 149 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:22:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3936 states. [2024-11-09 19:22:38,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3936 to 2081. [2024-11-09 19:22:38,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2081 states, 2080 states have (on average 1.7764423076923077) internal successors, (3695), 2080 states have internal predecessors, (3695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:38,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 3695 transitions. [2024-11-09 19:22:38,503 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 3695 transitions. Word has length 312 [2024-11-09 19:22:38,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:38,503 INFO L471 AbstractCegarLoop]: Abstraction has 2081 states and 3695 transitions. [2024-11-09 19:22:38,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:38,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 3695 transitions. [2024-11-09 19:22:38,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-09 19:22:38,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:38,508 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-09 19:22:38,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:22:38,509 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:38,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:38,509 INFO L85 PathProgramCache]: Analyzing trace with hash 240317594, now seen corresponding path program 1 times [2024-11-09 19:22:38,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:38,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034867342] [2024-11-09 19:22:38,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:38,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:22:38,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:38,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034867342] [2024-11-09 19:22:38,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034867342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:38,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:38,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:22:38,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143570184] [2024-11-09 19:22:38,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:38,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:22:38,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:38,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:22:38,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:22:38,846 INFO L87 Difference]: Start difference. First operand 2081 states and 3695 transitions. Second operand has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:40,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:40,073 INFO L93 Difference]: Finished difference Result 6389 states and 11374 transitions. [2024-11-09 19:22:40,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:22:40,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 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 351 [2024-11-09 19:22:40,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:40,088 INFO L225 Difference]: With dead ends: 6389 [2024-11-09 19:22:40,089 INFO L226 Difference]: Without dead ends: 4310 [2024-11-09 19:22:40,091 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-11-09 19:22:40,092 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 496 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:40,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 73 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1532 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 19:22:40,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4310 states. [2024-11-09 19:22:40,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4310 to 3753. [2024-11-09 19:22:40,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3753 states, 3752 states have (on average 1.7643923240938166) internal successors, (6620), 3752 states have internal predecessors, (6620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:40,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 6620 transitions. [2024-11-09 19:22:40,148 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 6620 transitions. Word has length 351 [2024-11-09 19:22:40,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:40,149 INFO L471 AbstractCegarLoop]: Abstraction has 3753 states and 6620 transitions. [2024-11-09 19:22:40,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:40,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 6620 transitions. [2024-11-09 19:22:40,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2024-11-09 19:22:40,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:40,157 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1] [2024-11-09 19:22:40,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 19:22:40,158 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:40,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:40,158 INFO L85 PathProgramCache]: Analyzing trace with hash -343640902, now seen corresponding path program 1 times [2024-11-09 19:22:40,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:40,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243890617] [2024-11-09 19:22:40,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:40,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:40,517 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 340 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-09 19:22:40,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:40,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243890617] [2024-11-09 19:22:40,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243890617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:40,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:40,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:22:40,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639228728] [2024-11-09 19:22:40,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:40,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:22:40,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:40,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:22:40,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:22:40,519 INFO L87 Difference]: Start difference. First operand 3753 states and 6620 transitions. Second operand has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:41,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:41,645 INFO L93 Difference]: Finished difference Result 8801 states and 15514 transitions. [2024-11-09 19:22:41,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:22:41,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 0 states have call successors, (0), 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 426 [2024-11-09 19:22:41,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:41,654 INFO L225 Difference]: With dead ends: 8801 [2024-11-09 19:22:41,654 INFO L226 Difference]: Without dead ends: 5050 [2024-11-09 19:22:41,657 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-11-09 19:22:41,658 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 496 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:41,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 73 Invalid, 1741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1532 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:22:41,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5050 states. [2024-11-09 19:22:41,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5050 to 3753. [2024-11-09 19:22:41,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3753 states, 3752 states have (on average 1.7643923240938166) internal successors, (6620), 3752 states have internal predecessors, (6620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:41,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 6620 transitions. [2024-11-09 19:22:41,719 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 6620 transitions. Word has length 426 [2024-11-09 19:22:41,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:41,720 INFO L471 AbstractCegarLoop]: Abstraction has 3753 states and 6620 transitions. [2024-11-09 19:22:41,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:41,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 6620 transitions. [2024-11-09 19:22:41,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2024-11-09 19:22:41,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:41,733 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 19:22:41,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:22:41,733 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:41,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:41,733 INFO L85 PathProgramCache]: Analyzing trace with hash 978176792, now seen corresponding path program 1 times [2024-11-09 19:22:41,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:41,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768902649] [2024-11-09 19:22:41,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:41,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:42,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1263 backedges. 861 proven. 0 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2024-11-09 19:22:42,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:42,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768902649] [2024-11-09 19:22:42,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768902649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:42,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:42,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:42,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92836192] [2024-11-09 19:22:42,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:42,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:22:42,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:42,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:22:42,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:22:42,199 INFO L87 Difference]: Start difference. First operand 3753 states and 6620 transitions. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:43,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:43,316 INFO L93 Difference]: Finished difference Result 11965 states and 21156 transitions. [2024-11-09 19:22:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 19:22:43,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 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 679 [2024-11-09 19:22:43,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:43,328 INFO L225 Difference]: With dead ends: 11965 [2024-11-09 19:22:43,328 INFO L226 Difference]: Without dead ends: 8214 [2024-11-09 19:22:43,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:22:43,332 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 462 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:43,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 90 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 19:22:43,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8214 states. [2024-11-09 19:22:43,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8214 to 7842. [2024-11-09 19:22:43,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7842 states, 7841 states have (on average 1.7561535518428772) internal successors, (13770), 7841 states have internal predecessors, (13770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:43,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7842 states to 7842 states and 13770 transitions. [2024-11-09 19:22:43,417 INFO L78 Accepts]: Start accepts. Automaton has 7842 states and 13770 transitions. Word has length 679 [2024-11-09 19:22:43,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:43,417 INFO L471 AbstractCegarLoop]: Abstraction has 7842 states and 13770 transitions. [2024-11-09 19:22:43,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:43,418 INFO L276 IsEmpty]: Start isEmpty. Operand 7842 states and 13770 transitions. [2024-11-09 19:22:43,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 749 [2024-11-09 19:22:43,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:43,431 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-09 19:22:43,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:22:43,431 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:43,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:43,431 INFO L85 PathProgramCache]: Analyzing trace with hash -554576309, now seen corresponding path program 1 times [2024-11-09 19:22:43,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:43,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724473214] [2024-11-09 19:22:43,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:43,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:43,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:43,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1664 backedges. 985 proven. 0 refuted. 0 times theorem prover too weak. 679 trivial. 0 not checked. [2024-11-09 19:22:43,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:43,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724473214] [2024-11-09 19:22:43,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724473214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:43,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:43,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:43,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326070977] [2024-11-09 19:22:43,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:43,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:43,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:43,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:43,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:43,783 INFO L87 Difference]: Start difference. First operand 7842 states and 13770 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:44,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:44,483 INFO L93 Difference]: Finished difference Result 17532 states and 30836 transitions. [2024-11-09 19:22:44,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:44,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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 748 [2024-11-09 19:22:44,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:44,498 INFO L225 Difference]: With dead ends: 17532 [2024-11-09 19:22:44,498 INFO L226 Difference]: Without dead ends: 8765 [2024-11-09 19:22:44,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:44,506 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 318 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:44,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 484 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:22:44,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8765 states. [2024-11-09 19:22:44,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8765 to 8765. [2024-11-09 19:22:44,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8765 states, 8764 states have (on average 1.7382473756275674) internal successors, (15234), 8764 states have internal predecessors, (15234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:44,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8765 states to 8765 states and 15234 transitions. [2024-11-09 19:22:44,655 INFO L78 Accepts]: Start accepts. Automaton has 8765 states and 15234 transitions. Word has length 748 [2024-11-09 19:22:44,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:44,656 INFO L471 AbstractCegarLoop]: Abstraction has 8765 states and 15234 transitions. [2024-11-09 19:22:44,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:44,657 INFO L276 IsEmpty]: Start isEmpty. Operand 8765 states and 15234 transitions. [2024-11-09 19:22:44,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 849 [2024-11-09 19:22:44,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:22:44,676 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:44,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 19:22:44,676 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:22:44,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:22:44,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1996654521, now seen corresponding path program 1 times [2024-11-09 19:22:44,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:22:44,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356602903] [2024-11-09 19:22:44,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:22:44,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:22:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:22:45,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 1476 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2024-11-09 19:22:45,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:22:45,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356602903] [2024-11-09 19:22:45,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356602903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:22:45,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:22:45,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:22:45,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295963302] [2024-11-09 19:22:45,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:22:45,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:22:45,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:22:45,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:22:45,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:45,041 INFO L87 Difference]: Start difference. First operand 8765 states and 15234 transitions. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:45,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:22:45,709 INFO L93 Difference]: Finished difference Result 18264 states and 31720 transitions. [2024-11-09 19:22:45,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:22:45,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 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 848 [2024-11-09 19:22:45,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:22:45,710 INFO L225 Difference]: With dead ends: 18264 [2024-11-09 19:22:45,710 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 19:22:45,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:22:45,720 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 183 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:22:45,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 448 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 19:22:45,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 19:22:45,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 19:22:45,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:45,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 19:22:45,723 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 848 [2024-11-09 19:22:45,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:22:45,723 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 19:22:45,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 19:22:45,723 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 19:22:45,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 19:22:45,726 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 19:22:45,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 19:22:45,729 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:22:45,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 19:22:46,701 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 19:22:46,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:22:46 BoogieIcfgContainer [2024-11-09 19:22:46,711 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 19:22:46,712 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 19:22:46,712 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 19:22:46,712 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 19:22:46,712 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:22:28" (3/4) ... [2024-11-09 19:22:46,714 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 19:22:46,742 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 19:22:46,743 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 19:22:46,744 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 19:22:46,745 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 19:22:46,893 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 19:22:46,894 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 19:22:46,894 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 19:22:46,894 INFO L158 Benchmark]: Toolchain (without parser) took 21004.46ms. Allocated memory was 165.7MB in the beginning and 589.3MB in the end (delta: 423.6MB). Free memory was 133.5MB in the beginning and 277.9MB in the end (delta: -144.4MB). Peak memory consumption was 280.3MB. Max. memory is 16.1GB. [2024-11-09 19:22:46,895 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 165.7MB. Free memory was 134.7MB in the beginning and 134.5MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 19:22:46,895 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.85ms. Allocated memory is still 165.7MB. Free memory was 133.5MB in the beginning and 85.7MB in the end (delta: 47.8MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-09 19:22:46,896 INFO L158 Benchmark]: Boogie Procedure Inliner took 142.77ms. Allocated memory is still 165.7MB. Free memory was 85.7MB in the beginning and 123.3MB in the end (delta: -37.6MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2024-11-09 19:22:46,896 INFO L158 Benchmark]: Boogie Preprocessor took 158.39ms. Allocated memory is still 165.7MB. Free memory was 123.3MB in the beginning and 98.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 19:22:46,897 INFO L158 Benchmark]: IcfgBuilder took 1553.19ms. Allocated memory was 165.7MB in the beginning and 220.2MB in the end (delta: 54.5MB). Free memory was 98.1MB in the beginning and 170.5MB in the end (delta: -72.4MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. [2024-11-09 19:22:46,897 INFO L158 Benchmark]: TraceAbstraction took 18468.33ms. Allocated memory was 220.2MB in the beginning and 589.3MB in the end (delta: 369.1MB). Free memory was 169.4MB in the beginning and 298.8MB in the end (delta: -129.4MB). Peak memory consumption was 383.4MB. Max. memory is 16.1GB. [2024-11-09 19:22:46,897 INFO L158 Benchmark]: Witness Printer took 182.25ms. Allocated memory is still 589.3MB. Free memory was 298.8MB in the beginning and 277.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 19:22:46,898 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.18ms. Allocated memory is still 165.7MB. Free memory was 134.7MB in the beginning and 134.5MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 494.85ms. Allocated memory is still 165.7MB. Free memory was 133.5MB in the beginning and 85.7MB in the end (delta: 47.8MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 142.77ms. Allocated memory is still 165.7MB. Free memory was 85.7MB in the beginning and 123.3MB in the end (delta: -37.6MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 158.39ms. Allocated memory is still 165.7MB. Free memory was 123.3MB in the beginning and 98.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1553.19ms. Allocated memory was 165.7MB in the beginning and 220.2MB in the end (delta: 54.5MB). Free memory was 98.1MB in the beginning and 170.5MB in the end (delta: -72.4MB). Peak memory consumption was 78.5MB. Max. memory is 16.1GB. * TraceAbstraction took 18468.33ms. Allocated memory was 220.2MB in the beginning and 589.3MB in the end (delta: 369.1MB). Free memory was 169.4MB in the beginning and 298.8MB in the end (delta: -129.4MB). Peak memory consumption was 383.4MB. Max. memory is 16.1GB. * Witness Printer took 182.25ms. Allocated memory is still 589.3MB. Free memory was 298.8MB in the beginning and 277.9MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. 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: 142]: 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, 286 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.4s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4455 SdHoareTripleChecker+Valid, 11.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4455 mSDsluCounter, 3953 SdHoareTripleChecker+Invalid, 9.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 398 mSDsCounter, 1728 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13226 IncrementalHoareTripleChecker+Invalid, 14954 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1728 mSolverCounterUnsat, 3555 mSDtfsCounter, 13226 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8765occurred in iteration=13, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 4686 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 4883 NumberOfCodeBlocks, 4883 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 4869 ConstructedInterpolants, 0 QuantifiedInterpolants, 8481 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 7090/7090 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]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 19:22:46,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE