./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label22.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label22.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 b6203532a9ef5ba90e15dbd2d5728025b7640a6606e85e563b08b8dcbd8cbea0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 21:19:46,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 21:19:46,992 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 21:19:46,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 21:19:46,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 21:19:47,018 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 21:19:47,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 21:19:47,019 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 21:19:47,019 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 21:19:47,020 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 21:19:47,020 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 21:19:47,021 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 21:19:47,021 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 21:19:47,021 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 21:19:47,023 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 21:19:47,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 21:19:47,023 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 21:19:47,023 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 21:19:47,024 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 21:19:47,024 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 21:19:47,024 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 21:19:47,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 21:19:47,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 21:19:47,028 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 21:19:47,028 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 21:19:47,029 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 21:19:47,029 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 21:19:47,029 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 21:19:47,029 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 21:19:47,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 21:19:47,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 21:19:47,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 21:19:47,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:19:47,030 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 21:19:47,030 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 21:19:47,030 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 21:19:47,031 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 21:19:47,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 21:19:47,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 21:19:47,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 21:19:47,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 21:19:47,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 21:19:47,033 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 -> b6203532a9ef5ba90e15dbd2d5728025b7640a6606e85e563b08b8dcbd8cbea0 [2024-11-21 21:19:47,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 21:19:47,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 21:19:47,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 21:19:47,291 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 21:19:47,302 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 21:19:47,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label22.c [2024-11-21 21:19:48,663 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 21:19:48,873 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 21:19:48,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label22.c [2024-11-21 21:19:48,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c12711436/b762c8c466db4caf91f77739b1bd1d64/FLAGe8b1df0f4 [2024-11-21 21:19:49,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c12711436/b762c8c466db4caf91f77739b1bd1d64 [2024-11-21 21:19:49,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 21:19:49,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 21:19:49,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 21:19:49,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 21:19:49,231 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 21:19:49,232 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:19:49" (1/1) ... [2024-11-21 21:19:49,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@216143c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:49, skipping insertion in model container [2024-11-21 21:19:49,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:19:49" (1/1) ... [2024-11-21 21:19:49,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 21:19:49,504 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/Problem02_label22.c[16445,16458] [2024-11-21 21:19:49,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:19:49,539 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 21:19:49,693 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/Problem02_label22.c[16445,16458] [2024-11-21 21:19:49,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 21:19:49,759 INFO L204 MainTranslator]: Completed translation [2024-11-21 21:19:49,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:49 WrapperNode [2024-11-21 21:19:49,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 21:19:49,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 21:19:49,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 21:19:49,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 21:19:49,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:49" (1/1) ... [2024-11-21 21:19:49,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:49" (1/1) ... [2024-11-21 21:19:49,840 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-11-21 21:19:49,840 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 21:19:49,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 21:19:49,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 21:19:49,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 21:19:49,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:49" (1/1) ... [2024-11-21 21:19:49,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:49" (1/1) ... [2024-11-21 21:19:49,853 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:49" (1/1) ... [2024-11-21 21:19:49,883 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-21 21:19:49,883 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:49" (1/1) ... [2024-11-21 21:19:49,884 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:49" (1/1) ... [2024-11-21 21:19:49,905 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:49" (1/1) ... [2024-11-21 21:19:49,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:49" (1/1) ... [2024-11-21 21:19:49,924 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:49" (1/1) ... [2024-11-21 21:19:49,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:49" (1/1) ... [2024-11-21 21:19:49,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 21:19:49,938 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 21:19:49,938 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 21:19:49,938 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 21:19:49,939 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:49" (1/1) ... [2024-11-21 21:19:49,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 21:19:49,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 21:19:49,970 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-21 21:19:49,976 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-21 21:19:50,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 21:19:50,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 21:19:50,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 21:19:50,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 21:19:50,071 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 21:19:50,073 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 21:19:50,763 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-21 21:19:50,763 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 21:19:50,781 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 21:19:50,782 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-21 21:19:50,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:19:50 BoogieIcfgContainer [2024-11-21 21:19:50,782 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 21:19:50,784 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 21:19:50,784 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 21:19:50,787 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 21:19:50,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:19:49" (1/3) ... [2024-11-21 21:19:50,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e29f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:19:50, skipping insertion in model container [2024-11-21 21:19:50,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:19:49" (2/3) ... [2024-11-21 21:19:50,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23e29f61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:19:50, skipping insertion in model container [2024-11-21 21:19:50,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:19:50" (3/3) ... [2024-11-21 21:19:50,790 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label22.c [2024-11-21 21:19:50,806 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 21:19:50,806 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 21:19:50,858 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 21:19:50,865 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;@2ee84dc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 21:19:50,865 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 21:19:50,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:50,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-21 21:19:50,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:50,877 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:19:50,878 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:50,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:50,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1473688725, now seen corresponding path program 1 times [2024-11-21 21:19:50,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:50,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821143940] [2024-11-21 21:19:50,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:50,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:19:51,292 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-21 21:19:51,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:19:51,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821143940] [2024-11-21 21:19:51,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821143940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:19:51,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:19:51,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:19:51,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317988134] [2024-11-21 21:19:51,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:19:51,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:19:51,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:19:51,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:19:51,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:51,321 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:51,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:19:51,853 INFO L93 Difference]: Finished difference Result 600 states and 1037 transitions. [2024-11-21 21:19:51,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:19:51,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2024-11-21 21:19:51,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:19:51,865 INFO L225 Difference]: With dead ends: 600 [2024-11-21 21:19:51,865 INFO L226 Difference]: Without dead ends: 309 [2024-11-21 21:19:51,868 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-21 21:19:51,870 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 69 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 21:19:51,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 171 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 21:19:51,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-21 21:19:51,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2024-11-21 21:19:51,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.3300653594771241) internal successors, (407), 306 states have internal predecessors, (407), 0 states have call successors, (0), 0 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-21 21:19:51,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 407 transitions. [2024-11-21 21:19:51,911 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 407 transitions. Word has length 97 [2024-11-21 21:19:51,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:19:51,911 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 407 transitions. [2024-11-21 21:19:51,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:51,912 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 407 transitions. [2024-11-21 21:19:51,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-21 21:19:51,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:51,914 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:19:51,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 21:19:51,915 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:51,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:51,915 INFO L85 PathProgramCache]: Analyzing trace with hash -2108530240, now seen corresponding path program 1 times [2024-11-21 21:19:51,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:51,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508455637] [2024-11-21 21:19:51,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:51,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:19:52,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:19:52,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:19:52,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508455637] [2024-11-21 21:19:52,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508455637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:19:52,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:19:52,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:19:52,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248316523] [2024-11-21 21:19:52,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:19:52,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:19:52,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:19:52,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:19:52,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:52,104 INFO L87 Difference]: Start difference. First operand 307 states and 407 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:52,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:19:52,558 INFO L93 Difference]: Finished difference Result 758 states and 1034 transitions. [2024-11-21 21:19:52,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:19:52,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2024-11-21 21:19:52,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:19:52,561 INFO L225 Difference]: With dead ends: 758 [2024-11-21 21:19:52,561 INFO L226 Difference]: Without dead ends: 453 [2024-11-21 21:19:52,562 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-21 21:19:52,563 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 67 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:19:52,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 248 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:19:52,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-21 21:19:52,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2024-11-21 21:19:52,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.2787610619469028) internal successors, (578), 452 states have internal predecessors, (578), 0 states have call successors, (0), 0 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-21 21:19:52,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 578 transitions. [2024-11-21 21:19:52,584 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 578 transitions. Word has length 102 [2024-11-21 21:19:52,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:19:52,585 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 578 transitions. [2024-11-21 21:19:52,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:52,586 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 578 transitions. [2024-11-21 21:19:52,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-21 21:19:52,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:52,590 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-21 21:19:52,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 21:19:52,591 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:52,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:52,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1211879525, now seen corresponding path program 1 times [2024-11-21 21:19:52,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:52,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844295640] [2024-11-21 21:19:52,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:52,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:19:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:19:52,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:19:52,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844295640] [2024-11-21 21:19:52,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844295640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:19:52,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:19:52,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:19:52,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012376270] [2024-11-21 21:19:52,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:19:52,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:19:52,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:19:52,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:19:52,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:52,745 INFO L87 Difference]: Start difference. First operand 453 states and 578 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 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-21 21:19:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:19:53,165 INFO L93 Difference]: Finished difference Result 1325 states and 1691 transitions. [2024-11-21 21:19:53,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:19:53,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2024-11-21 21:19:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:19:53,168 INFO L225 Difference]: With dead ends: 1325 [2024-11-21 21:19:53,170 INFO L226 Difference]: Without dead ends: 874 [2024-11-21 21:19:53,171 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-21 21:19:53,175 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 185 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:19:53,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 79 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:19:53,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-21 21:19:53,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2024-11-21 21:19:53,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 873 states have (on average 1.2302405498281788) internal successors, (1074), 873 states have internal predecessors, (1074), 0 states have call successors, (0), 0 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-21 21:19:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1074 transitions. [2024-11-21 21:19:53,210 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1074 transitions. Word has length 114 [2024-11-21 21:19:53,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:19:53,211 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1074 transitions. [2024-11-21 21:19:53,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 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-21 21:19:53,211 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1074 transitions. [2024-11-21 21:19:53,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-21 21:19:53,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:53,213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:19:53,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 21:19:53,214 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:53,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:53,214 INFO L85 PathProgramCache]: Analyzing trace with hash 92854696, now seen corresponding path program 1 times [2024-11-21 21:19:53,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:53,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363101889] [2024-11-21 21:19:53,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:53,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:19:53,321 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:19:53,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:19:53,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363101889] [2024-11-21 21:19:53,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363101889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:19:53,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:19:53,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:19:53,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677455155] [2024-11-21 21:19:53,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:19:53,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:19:53,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:19:53,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:19:53,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:53,323 INFO L87 Difference]: Start difference. First operand 874 states and 1074 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:53,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:19:53,691 INFO L93 Difference]: Finished difference Result 2027 states and 2555 transitions. [2024-11-21 21:19:53,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:19:53,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2024-11-21 21:19:53,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:19:53,698 INFO L225 Difference]: With dead ends: 2027 [2024-11-21 21:19:53,698 INFO L226 Difference]: Without dead ends: 1155 [2024-11-21 21:19:53,699 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-21 21:19:53,700 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 77 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:19:53,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 226 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 21:19:53,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-11-21 21:19:53,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1154. [2024-11-21 21:19:53,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 1.2437120555073722) internal successors, (1434), 1153 states have internal predecessors, (1434), 0 states have call successors, (0), 0 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-21 21:19:53,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1434 transitions. [2024-11-21 21:19:53,715 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1434 transitions. Word has length 127 [2024-11-21 21:19:53,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:19:53,715 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1434 transitions. [2024-11-21 21:19:53,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:53,716 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1434 transitions. [2024-11-21 21:19:53,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-21 21:19:53,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:53,717 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:19:53,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 21:19:53,718 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:53,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:53,718 INFO L85 PathProgramCache]: Analyzing trace with hash 952160173, now seen corresponding path program 1 times [2024-11-21 21:19:53,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:53,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859483341] [2024-11-21 21:19:53,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:53,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:53,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:19:53,798 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-21 21:19:53,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:19:53,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859483341] [2024-11-21 21:19:53,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859483341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:19:53,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:19:53,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 21:19:53,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994012341] [2024-11-21 21:19:53,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:19:53,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:19:53,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:19:53,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:19:53,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:53,800 INFO L87 Difference]: Start difference. First operand 1154 states and 1434 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 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-21 21:19:54,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:19:54,021 INFO L93 Difference]: Finished difference Result 2295 states and 2852 transitions. [2024-11-21 21:19:54,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:19:54,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2024-11-21 21:19:54,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:19:54,024 INFO L225 Difference]: With dead ends: 2295 [2024-11-21 21:19:54,024 INFO L226 Difference]: Without dead ends: 1143 [2024-11-21 21:19:54,025 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-21 21:19:54,026 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 181 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-21 21:19:54,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 23 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-21 21:19:54,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2024-11-21 21:19:54,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1143. [2024-11-21 21:19:54,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 1142 states have (on average 1.1996497373029773) internal successors, (1370), 1142 states have internal predecessors, (1370), 0 states have call successors, (0), 0 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-21 21:19:54,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1370 transitions. [2024-11-21 21:19:54,038 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1370 transitions. Word has length 130 [2024-11-21 21:19:54,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:19:54,038 INFO L471 AbstractCegarLoop]: Abstraction has 1143 states and 1370 transitions. [2024-11-21 21:19:54,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 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-21 21:19:54,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1370 transitions. [2024-11-21 21:19:54,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-21 21:19:54,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:54,040 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:19:54,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 21:19:54,041 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:54,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:54,041 INFO L85 PathProgramCache]: Analyzing trace with hash -60341521, now seen corresponding path program 1 times [2024-11-21 21:19:54,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:54,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014984049] [2024-11-21 21:19:54,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:54,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:19:54,126 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-21 21:19:54,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:19:54,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014984049] [2024-11-21 21:19:54,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014984049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:19:54,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:19:54,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:19:54,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926613494] [2024-11-21 21:19:54,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:19:54,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:19:54,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:19:54,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:19:54,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:54,129 INFO L87 Difference]: Start difference. First operand 1143 states and 1370 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 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-21 21:19:54,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:19:54,565 INFO L93 Difference]: Finished difference Result 3128 states and 3710 transitions. [2024-11-21 21:19:54,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:19:54,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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 136 [2024-11-21 21:19:54,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:19:54,571 INFO L225 Difference]: With dead ends: 3128 [2024-11-21 21:19:54,571 INFO L226 Difference]: Without dead ends: 1987 [2024-11-21 21:19:54,573 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-21 21:19:54,574 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 142 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:19:54,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 86 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:19:54,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2024-11-21 21:19:54,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1704. [2024-11-21 21:19:54,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1704 states, 1703 states have (on average 1.1720493247210804) internal successors, (1996), 1703 states have internal predecessors, (1996), 0 states have call successors, (0), 0 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-21 21:19:54,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 1996 transitions. [2024-11-21 21:19:54,602 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 1996 transitions. Word has length 136 [2024-11-21 21:19:54,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:19:54,602 INFO L471 AbstractCegarLoop]: Abstraction has 1704 states and 1996 transitions. [2024-11-21 21:19:54,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 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-21 21:19:54,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 1996 transitions. [2024-11-21 21:19:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-21 21:19:54,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:54,606 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-21 21:19:54,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 21:19:54,606 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:54,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:54,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1997465720, now seen corresponding path program 1 times [2024-11-21 21:19:54,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:54,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169804412] [2024-11-21 21:19:54,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:54,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:19:54,693 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-21 21:19:54,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:19:54,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169804412] [2024-11-21 21:19:54,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169804412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:19:54,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:19:54,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:19:54,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673898359] [2024-11-21 21:19:54,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:19:54,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:19:54,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:19:54,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:19:54,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:54,695 INFO L87 Difference]: Start difference. First operand 1704 states and 1996 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 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-21 21:19:55,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:19:55,153 INFO L93 Difference]: Finished difference Result 3686 states and 4295 transitions. [2024-11-21 21:19:55,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:19:55,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 143 [2024-11-21 21:19:55,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:19:55,158 INFO L225 Difference]: With dead ends: 3686 [2024-11-21 21:19:55,158 INFO L226 Difference]: Without dead ends: 1702 [2024-11-21 21:19:55,160 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-21 21:19:55,160 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 149 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-21 21:19:55,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 40 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-21 21:19:55,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2024-11-21 21:19:55,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1562. [2024-11-21 21:19:55,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1561 states have (on average 1.0890454836643177) internal successors, (1700), 1561 states have internal predecessors, (1700), 0 states have call successors, (0), 0 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-21 21:19:55,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 1700 transitions. [2024-11-21 21:19:55,176 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 1700 transitions. Word has length 143 [2024-11-21 21:19:55,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:19:55,176 INFO L471 AbstractCegarLoop]: Abstraction has 1562 states and 1700 transitions. [2024-11-21 21:19:55,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 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-21 21:19:55,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 1700 transitions. [2024-11-21 21:19:55,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-21 21:19:55,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:55,178 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-21 21:19:55,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-21 21:19:55,179 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:55,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:55,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1562737042, now seen corresponding path program 1 times [2024-11-21 21:19:55,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:55,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70929279] [2024-11-21 21:19:55,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:55,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:19:55,365 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-21 21:19:55,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:19:55,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70929279] [2024-11-21 21:19:55,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70929279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:19:55,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:19:55,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 21:19:55,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361671721] [2024-11-21 21:19:55,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:19:55,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 21:19:55,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:19:55,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 21:19:55,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-21 21:19:55,367 INFO L87 Difference]: Start difference. First operand 1562 states and 1700 transitions. Second operand has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:55,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:19:55,938 INFO L93 Difference]: Finished difference Result 3259 states and 3551 transitions. [2024-11-21 21:19:55,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 21:19:55,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2024-11-21 21:19:55,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:19:55,943 INFO L225 Difference]: With dead ends: 3259 [2024-11-21 21:19:55,943 INFO L226 Difference]: Without dead ends: 1699 [2024-11-21 21:19:55,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-21 21:19:55,945 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 325 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-21 21:19:55,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 93 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 21:19:55,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2024-11-21 21:19:55,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1559. [2024-11-21 21:19:55,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1558 states have (on average 1.0937098844672657) internal successors, (1704), 1558 states have internal predecessors, (1704), 0 states have call successors, (0), 0 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-21 21:19:55,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 1704 transitions. [2024-11-21 21:19:55,960 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 1704 transitions. Word has length 147 [2024-11-21 21:19:55,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:19:55,960 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 1704 transitions. [2024-11-21 21:19:55,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.6) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-21 21:19:55,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 1704 transitions. [2024-11-21 21:19:55,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-21 21:19:55,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:55,963 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 21:19:55,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-21 21:19:55,963 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:55,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:55,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1048369386, now seen corresponding path program 1 times [2024-11-21 21:19:55,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:55,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534949218] [2024-11-21 21:19:55,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:55,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:19:56,052 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-21 21:19:56,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:19:56,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534949218] [2024-11-21 21:19:56,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534949218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:19:56,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:19:56,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:19:56,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936662957] [2024-11-21 21:19:56,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:19:56,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:19:56,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:19:56,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:19:56,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:56,054 INFO L87 Difference]: Start difference. First operand 1559 states and 1704 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 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-21 21:19:56,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:19:56,345 INFO L93 Difference]: Finished difference Result 3676 states and 4006 transitions. [2024-11-21 21:19:56,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:19:56,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 191 [2024-11-21 21:19:56,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:19:56,351 INFO L225 Difference]: With dead ends: 3676 [2024-11-21 21:19:56,351 INFO L226 Difference]: Without dead ends: 1137 [2024-11-21 21:19:56,353 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-21 21:19:56,353 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 95 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:19:56,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 216 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 21:19:56,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2024-11-21 21:19:56,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1136. [2024-11-21 21:19:56,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 1135 states have (on average 1.0669603524229074) internal successors, (1211), 1135 states have internal predecessors, (1211), 0 states have call successors, (0), 0 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-21 21:19:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1211 transitions. [2024-11-21 21:19:56,382 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1211 transitions. Word has length 191 [2024-11-21 21:19:56,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:19:56,382 INFO L471 AbstractCegarLoop]: Abstraction has 1136 states and 1211 transitions. [2024-11-21 21:19:56,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 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-21 21:19:56,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1211 transitions. [2024-11-21 21:19:56,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-21 21:19:56,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:56,385 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-21 21:19:56,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-21 21:19:56,385 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:56,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:56,386 INFO L85 PathProgramCache]: Analyzing trace with hash -64714671, now seen corresponding path program 1 times [2024-11-21 21:19:56,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:56,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809004612] [2024-11-21 21:19:56,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:56,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:19:56,490 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-21 21:19:56,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:19:56,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809004612] [2024-11-21 21:19:56,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809004612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:19:56,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:19:56,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:19:56,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960876748] [2024-11-21 21:19:56,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:19:56,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:19:56,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:19:56,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:19:56,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:56,493 INFO L87 Difference]: Start difference. First operand 1136 states and 1211 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 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-21 21:19:56,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:19:56,724 INFO L93 Difference]: Finished difference Result 2694 states and 2858 transitions. [2024-11-21 21:19:56,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:19:56,724 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 198 [2024-11-21 21:19:56,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:19:56,727 INFO L225 Difference]: With dead ends: 2694 [2024-11-21 21:19:56,728 INFO L226 Difference]: Without dead ends: 1276 [2024-11-21 21:19:56,729 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-21 21:19:56,730 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 57 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-21 21:19:56,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 201 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-21 21:19:56,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2024-11-21 21:19:56,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1134. [2024-11-21 21:19:56,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 1133 states have (on average 1.0388349514563107) internal successors, (1177), 1133 states have internal predecessors, (1177), 0 states have call successors, (0), 0 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-21 21:19:56,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1177 transitions. [2024-11-21 21:19:56,743 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1177 transitions. Word has length 198 [2024-11-21 21:19:56,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:19:56,743 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1177 transitions. [2024-11-21 21:19:56,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 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-21 21:19:56,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1177 transitions. [2024-11-21 21:19:56,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-21 21:19:56,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 21:19:56,745 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 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] [2024-11-21 21:19:56,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-21 21:19:56,746 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 21:19:56,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 21:19:56,746 INFO L85 PathProgramCache]: Analyzing trace with hash -318196994, now seen corresponding path program 1 times [2024-11-21 21:19:56,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 21:19:56,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077656663] [2024-11-21 21:19:56,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 21:19:56,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 21:19:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 21:19:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-21 21:19:56,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 21:19:56,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077656663] [2024-11-21 21:19:56,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077656663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 21:19:56,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 21:19:56,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-21 21:19:56,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4848485] [2024-11-21 21:19:56,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 21:19:56,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-21 21:19:56,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 21:19:56,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-21 21:19:56,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-21 21:19:56,858 INFO L87 Difference]: Start difference. First operand 1134 states and 1177 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 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-21 21:19:57,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 21:19:57,129 INFO L93 Difference]: Finished difference Result 2124 states and 2209 transitions. [2024-11-21 21:19:57,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-21 21:19:57,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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-21 21:19:57,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 21:19:57,130 INFO L225 Difference]: With dead ends: 2124 [2024-11-21 21:19:57,131 INFO L226 Difference]: Without dead ends: 0 [2024-11-21 21:19:57,132 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-21 21:19:57,132 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 58 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-21 21:19:57,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 170 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-21 21:19:57,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-21 21:19:57,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-21 21:19:57,133 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-21 21:19:57,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-21 21:19:57,133 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 234 [2024-11-21 21:19:57,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 21:19:57,133 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-21 21:19:57,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 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-21 21:19:57,133 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-21 21:19:57,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-21 21:19:57,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 21:19:57,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-21 21:19:57,140 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 21:19:57,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-21 21:19:57,333 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 21:19:57,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 09:19:57 BoogieIcfgContainer [2024-11-21 21:19:57,351 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 21:19:57,352 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 21:19:57,352 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 21:19:57,352 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 21:19:57,353 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:19:50" (3/4) ... [2024-11-21 21:19:57,354 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-21 21:19:57,365 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-21 21:19:57,365 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-21 21:19:57,366 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-21 21:19:57,366 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-21 21:19:57,473 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-21 21:19:57,473 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-21 21:19:57,473 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 21:19:57,474 INFO L158 Benchmark]: Toolchain (without parser) took 8248.76ms. Allocated memory was 155.2MB in the beginning and 320.9MB in the end (delta: 165.7MB). Free memory was 80.8MB in the beginning and 173.3MB in the end (delta: -92.5MB). Peak memory consumption was 75.5MB. Max. memory is 16.1GB. [2024-11-21 21:19:57,474 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory was 107.1MB in the beginning and 106.9MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 21:19:57,474 INFO L158 Benchmark]: CACSL2BoogieTranslator took 533.33ms. Allocated memory was 155.2MB in the beginning and 234.9MB in the end (delta: 79.7MB). Free memory was 80.6MB in the beginning and 198.7MB in the end (delta: -118.1MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2024-11-21 21:19:57,475 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.33ms. Allocated memory is still 234.9MB. Free memory was 198.7MB in the beginning and 192.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-21 21:19:57,475 INFO L158 Benchmark]: Boogie Preprocessor took 95.59ms. Allocated memory is still 234.9MB. Free memory was 192.4MB in the beginning and 187.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-21 21:19:57,475 INFO L158 Benchmark]: RCFGBuilder took 844.84ms. Allocated memory is still 234.9MB. Free memory was 187.2MB in the beginning and 106.5MB in the end (delta: 80.7MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. [2024-11-21 21:19:57,475 INFO L158 Benchmark]: TraceAbstraction took 6567.59ms. Allocated memory was 234.9MB in the beginning and 320.9MB in the end (delta: 86.0MB). Free memory was 106.5MB in the beginning and 184.9MB in the end (delta: -78.4MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-11-21 21:19:57,475 INFO L158 Benchmark]: Witness Printer took 121.59ms. Allocated memory is still 320.9MB. Free memory was 184.9MB in the beginning and 173.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-21 21:19:57,477 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 155.2MB. Free memory was 107.1MB in the beginning and 106.9MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 533.33ms. Allocated memory was 155.2MB in the beginning and 234.9MB in the end (delta: 79.7MB). Free memory was 80.6MB in the beginning and 198.7MB in the end (delta: -118.1MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.33ms. Allocated memory is still 234.9MB. Free memory was 198.7MB in the beginning and 192.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.59ms. Allocated memory is still 234.9MB. Free memory was 192.4MB in the beginning and 187.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 844.84ms. Allocated memory is still 234.9MB. Free memory was 187.2MB in the beginning and 106.5MB in the end (delta: 80.7MB). Peak memory consumption was 81.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6567.59ms. Allocated memory was 234.9MB in the beginning and 320.9MB in the end (delta: 86.0MB). Free memory was 106.5MB in the beginning and 184.9MB in the end (delta: -78.4MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Witness Printer took 121.59ms. Allocated memory is still 320.9MB. Free memory was 184.9MB in the beginning and 173.3MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. 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: 473]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1405 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1405 mSDsluCounter, 1553 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 183 mSDsCounter, 637 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4115 IncrementalHoareTripleChecker+Invalid, 4752 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 637 mSolverCounterUnsat, 1370 mSDtfsCounter, 4115 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1704occurred in iteration=6, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 709 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1619 NumberOfCodeBlocks, 1619 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1608 ConstructedInterpolants, 0 QuantifiedInterpolants, 3490 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 807/807 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: 616]: Loop Invariant Derived loop invariant: ((((((((((a25 == 1) && (a17 <= 8)) && (a28 <= 10)) && (a19 == 1)) || ((a28 == 10) && (a17 <= 8))) || ((((((a17 == 8) && (a25 == 1)) && (a28 == 11)) && (a21 == 1)) && (a19 == 1)) && (a11 != 1))) || (((((a17 == 8) && (9 <= a28)) && (a21 == 1)) && (a28 <= 10)) && (a19 == 1))) || ((a17 <= 8) && (a28 <= 7))) || ((((9 <= a28) && (a11 == 1)) && (a17 <= 8)) && (a28 <= 10))) || ((((a19 != 1) && (a17 <= 8)) && (a28 <= 10)) && (a25 != 1))) RESULT: Ultimate proved your program to be correct! [2024-11-21 21:19:57,493 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