./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label05.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 6631d0bd13862b684e6a1ef7d33df65b972a07047361d83162cfc056e8521a6a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 20:18:51,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 20:18:51,727 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 20:18:51,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 20:18:51,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 20:18:51,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 20:18:51,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 20:18:51,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 20:18:51,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 20:18:51,781 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 20:18:51,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 20:18:51,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 20:18:51,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 20:18:51,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 20:18:51,783 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 20:18:51,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 20:18:51,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 20:18:51,785 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 20:18:51,785 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 20:18:51,786 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 20:18:51,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 20:18:51,788 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 20:18:51,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 20:18:51,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 20:18:51,789 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 20:18:51,789 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 20:18:51,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 20:18:51,790 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 20:18:51,790 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 20:18:51,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 20:18:51,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 20:18:51,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 20:18:51,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 20:18:51,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 20:18:51,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 20:18:51,791 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 20:18:51,791 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 20:18:51,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 20:18:51,792 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 20:18:51,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 20:18:51,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 20:18:51,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 20:18:51,795 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 -> 6631d0bd13862b684e6a1ef7d33df65b972a07047361d83162cfc056e8521a6a [2024-10-23 20:18:51,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 20:18:52,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 20:18:52,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 20:18:52,026 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 20:18:52,027 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 20:18:52,027 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label05.c [2024-10-23 20:18:53,509 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 20:18:53,843 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 20:18:53,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label05.c [2024-10-23 20:18:53,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91cb4779d/72d560f24bb64589aa3e7313cb2c6b40/FLAG1d7d7043a [2024-10-23 20:18:53,868 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91cb4779d/72d560f24bb64589aa3e7313cb2c6b40 [2024-10-23 20:18:53,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 20:18:53,871 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 20:18:53,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 20:18:53,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 20:18:53,880 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 20:18:53,881 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:18:53" (1/1) ... [2024-10-23 20:18:53,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a876d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:53, skipping insertion in model container [2024-10-23 20:18:53,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:18:53" (1/1) ... [2024-10-23 20:18:53,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 20:18:54,212 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label05.c[19738,19751] [2024-10-23 20:18:54,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 20:18:54,254 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 20:18:54,331 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label05.c[19738,19751] [2024-10-23 20:18:54,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 20:18:54,353 INFO L204 MainTranslator]: Completed translation [2024-10-23 20:18:54,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:54 WrapperNode [2024-10-23 20:18:54,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 20:18:54,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 20:18:54,355 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 20:18:54,355 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 20:18:54,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:54" (1/1) ... [2024-10-23 20:18:54,381 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:54" (1/1) ... [2024-10-23 20:18:54,437 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-10-23 20:18:54,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 20:18:54,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 20:18:54,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 20:18:54,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 20:18:54,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:54" (1/1) ... [2024-10-23 20:18:54,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:54" (1/1) ... [2024-10-23 20:18:54,459 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:54" (1/1) ... [2024-10-23 20:18:54,487 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-23 20:18:54,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:54" (1/1) ... [2024-10-23 20:18:54,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:54" (1/1) ... [2024-10-23 20:18:54,508 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:54" (1/1) ... [2024-10-23 20:18:54,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:54" (1/1) ... [2024-10-23 20:18:54,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:54" (1/1) ... [2024-10-23 20:18:54,534 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:54" (1/1) ... [2024-10-23 20:18:54,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 20:18:54,541 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 20:18:54,541 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 20:18:54,541 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 20:18:54,542 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:54" (1/1) ... [2024-10-23 20:18:54,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 20:18:54,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:18:54,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 20:18:54,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 20:18:54,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 20:18:54,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 20:18:54,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 20:18:54,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 20:18:54,666 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 20:18:54,667 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 20:18:55,298 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-23 20:18:55,298 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 20:18:55,330 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 20:18:55,330 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-23 20:18:55,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:18:55 BoogieIcfgContainer [2024-10-23 20:18:55,331 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 20:18:55,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 20:18:55,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 20:18:55,338 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 20:18:55,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:18:53" (1/3) ... [2024-10-23 20:18:55,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d95a9b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:18:55, skipping insertion in model container [2024-10-23 20:18:55,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:54" (2/3) ... [2024-10-23 20:18:55,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d95a9b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:18:55, skipping insertion in model container [2024-10-23 20:18:55,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:18:55" (3/3) ... [2024-10-23 20:18:55,341 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label05.c [2024-10-23 20:18:55,355 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 20:18:55,355 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 20:18:55,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 20:18:55,409 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;@608548ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 20:18:55,409 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 20:18:55,413 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:55,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-23 20:18:55,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:18:55,421 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:18:55,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:18:55,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:18:55,425 INFO L85 PathProgramCache]: Analyzing trace with hash 323127497, now seen corresponding path program 1 times [2024-10-23 20:18:55,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:18:55,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932481587] [2024-10-23 20:18:55,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:55,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:18:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:18:55,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:18:55,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932481587] [2024-10-23 20:18:55,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932481587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:18:55,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:18:55,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:18:55,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700508308] [2024-10-23 20:18:55,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:18:55,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 20:18:55,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:18:55,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 20:18:55,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 20:18:55,708 INFO L87 Difference]: Start difference. First operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:18:55,744 INFO L93 Difference]: Finished difference Result 329 states and 625 transitions. [2024-10-23 20:18:55,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 20:18:55,747 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-10-23 20:18:55,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:18:55,757 INFO L225 Difference]: With dead ends: 329 [2024-10-23 20:18:55,757 INFO L226 Difference]: Without dead ends: 163 [2024-10-23 20:18:55,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 20:18:55,762 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 20:18:55,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 20:18:55,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-23 20:18:55,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2024-10-23 20:18:55,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:55,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 248 transitions. [2024-10-23 20:18:55,793 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 248 transitions. Word has length 125 [2024-10-23 20:18:55,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:18:55,794 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 248 transitions. [2024-10-23 20:18:55,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:55,794 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 248 transitions. [2024-10-23 20:18:55,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-23 20:18:55,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:18:55,796 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:18:55,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 20:18:55,796 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:18:55,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:18:55,797 INFO L85 PathProgramCache]: Analyzing trace with hash -585671754, now seen corresponding path program 1 times [2024-10-23 20:18:55,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:18:55,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973257883] [2024-10-23 20:18:55,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:55,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:18:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:55,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:18:55,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:18:55,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973257883] [2024-10-23 20:18:56,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973257883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:18:56,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:18:56,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:18:56,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934535656] [2024-10-23 20:18:56,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:18:56,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:18:56,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:18:56,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:18:56,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:56,002 INFO L87 Difference]: Start difference. First operand 163 states and 248 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:56,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:18:56,502 INFO L93 Difference]: Finished difference Result 470 states and 719 transitions. [2024-10-23 20:18:56,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:18:56,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-10-23 20:18:56,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:18:56,505 INFO L225 Difference]: With dead ends: 470 [2024-10-23 20:18:56,505 INFO L226 Difference]: Without dead ends: 308 [2024-10-23 20:18:56,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:56,507 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 24 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 20:18:56,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 116 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 20:18:56,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-10-23 20:18:56,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 306. [2024-10-23 20:18:56,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 305 states have (on average 1.3311475409836067) internal successors, (406), 305 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:56,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 406 transitions. [2024-10-23 20:18:56,520 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 406 transitions. Word has length 125 [2024-10-23 20:18:56,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:18:56,520 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 406 transitions. [2024-10-23 20:18:56,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:56,521 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 406 transitions. [2024-10-23 20:18:56,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-23 20:18:56,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:18:56,522 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:18:56,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 20:18:56,523 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:18:56,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:18:56,523 INFO L85 PathProgramCache]: Analyzing trace with hash -86039633, now seen corresponding path program 1 times [2024-10-23 20:18:56,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:18:56,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692634093] [2024-10-23 20:18:56,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:56,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:18:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:56,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-23 20:18:56,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:18:56,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692634093] [2024-10-23 20:18:56,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692634093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:18:56,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:18:56,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:18:56,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035396022] [2024-10-23 20:18:56,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:18:56,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:18:56,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:18:56,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:18:56,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:56,763 INFO L87 Difference]: Start difference. First operand 306 states and 406 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:57,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:18:57,183 INFO L93 Difference]: Finished difference Result 892 states and 1183 transitions. [2024-10-23 20:18:57,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:18:57,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 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 130 [2024-10-23 20:18:57,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:18:57,186 INFO L225 Difference]: With dead ends: 892 [2024-10-23 20:18:57,188 INFO L226 Difference]: Without dead ends: 587 [2024-10-23 20:18:57,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:57,192 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 92 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:18:57,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 42 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:18:57,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2024-10-23 20:18:57,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 447. [2024-10-23 20:18:57,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 446 states have (on average 1.3923766816143497) internal successors, (621), 446 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:57,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 621 transitions. [2024-10-23 20:18:57,208 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 621 transitions. Word has length 130 [2024-10-23 20:18:57,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:18:57,208 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 621 transitions. [2024-10-23 20:18:57,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:57,209 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 621 transitions. [2024-10-23 20:18:57,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-23 20:18:57,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:18:57,211 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:18:57,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 20:18:57,211 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:18:57,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:18:57,212 INFO L85 PathProgramCache]: Analyzing trace with hash -154876192, now seen corresponding path program 1 times [2024-10-23 20:18:57,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:18:57,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656786225] [2024-10-23 20:18:57,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:57,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:18:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:57,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:18:57,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:18:57,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656786225] [2024-10-23 20:18:57,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656786225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:18:57,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:18:57,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:18:57,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296998170] [2024-10-23 20:18:57,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:18:57,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:18:57,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:18:57,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:18:57,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:57,362 INFO L87 Difference]: Start difference. First operand 447 states and 621 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:57,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:18:57,771 INFO L93 Difference]: Finished difference Result 1326 states and 1845 transitions. [2024-10-23 20:18:57,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:18:57,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 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-10-23 20:18:57,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:18:57,774 INFO L225 Difference]: With dead ends: 1326 [2024-10-23 20:18:57,774 INFO L226 Difference]: Without dead ends: 880 [2024-10-23 20:18:57,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:57,776 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 191 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:18:57,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 69 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:18:57,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-10-23 20:18:57,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 739. [2024-10-23 20:18:57,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 738 states have (on average 1.3360433604336044) internal successors, (986), 738 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:57,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 986 transitions. [2024-10-23 20:18:57,794 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 986 transitions. Word has length 136 [2024-10-23 20:18:57,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:18:57,794 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 986 transitions. [2024-10-23 20:18:57,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:57,795 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 986 transitions. [2024-10-23 20:18:57,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-10-23 20:18:57,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:18:57,798 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:18:57,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 20:18:57,798 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:18:57,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:18:57,799 INFO L85 PathProgramCache]: Analyzing trace with hash 838209904, now seen corresponding path program 1 times [2024-10-23 20:18:57,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:18:57,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117903746] [2024-10-23 20:18:57,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:57,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:18:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:18:57,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:18:57,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117903746] [2024-10-23 20:18:57,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117903746] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:18:57,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:18:57,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:18:57,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436683125] [2024-10-23 20:18:57,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:18:57,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:18:57,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:18:57,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:18:57,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:57,889 INFO L87 Difference]: Start difference. First operand 739 states and 986 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:58,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:18:58,259 INFO L93 Difference]: Finished difference Result 2190 states and 2928 transitions. [2024-10-23 20:18:58,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:18:58,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2024-10-23 20:18:58,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:18:58,263 INFO L225 Difference]: With dead ends: 2190 [2024-10-23 20:18:58,264 INFO L226 Difference]: Without dead ends: 1452 [2024-10-23 20:18:58,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:58,265 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 151 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 20:18:58,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 112 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 20:18:58,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2024-10-23 20:18:58,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1163. [2024-10-23 20:18:58,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 1162 states have (on average 1.3158347676419966) internal successors, (1529), 1162 states have internal predecessors, (1529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:58,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1529 transitions. [2024-10-23 20:18:58,288 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1529 transitions. Word has length 148 [2024-10-23 20:18:58,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:18:58,288 INFO L471 AbstractCegarLoop]: Abstraction has 1163 states and 1529 transitions. [2024-10-23 20:18:58,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:58,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1529 transitions. [2024-10-23 20:18:58,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-23 20:18:58,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:18:58,292 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:18:58,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 20:18:58,292 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:18:58,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:18:58,293 INFO L85 PathProgramCache]: Analyzing trace with hash 2124206044, now seen corresponding path program 1 times [2024-10-23 20:18:58,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:18:58,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111879080] [2024-10-23 20:18:58,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:58,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:18:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:18:58,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:18:58,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111879080] [2024-10-23 20:18:58,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111879080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:18:58,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:18:58,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:18:58,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401319547] [2024-10-23 20:18:58,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:18:58,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:18:58,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:18:58,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:18:58,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:58,399 INFO L87 Difference]: Start difference. First operand 1163 states and 1529 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:58,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:18:58,773 INFO L93 Difference]: Finished difference Result 2889 states and 3861 transitions. [2024-10-23 20:18:58,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:18:58,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2024-10-23 20:18:58,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:18:58,778 INFO L225 Difference]: With dead ends: 2889 [2024-10-23 20:18:58,778 INFO L226 Difference]: Without dead ends: 1727 [2024-10-23 20:18:58,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:58,780 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 137 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 20:18:58,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 238 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 20:18:58,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1727 states. [2024-10-23 20:18:58,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1727 to 1727. [2024-10-23 20:18:58,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1727 states, 1726 states have (on average 1.2589803012746235) internal successors, (2173), 1726 states have internal predecessors, (2173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:58,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1727 states to 1727 states and 2173 transitions. [2024-10-23 20:18:58,802 INFO L78 Accepts]: Start accepts. Automaton has 1727 states and 2173 transitions. Word has length 156 [2024-10-23 20:18:58,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:18:58,802 INFO L471 AbstractCegarLoop]: Abstraction has 1727 states and 2173 transitions. [2024-10-23 20:18:58,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:58,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1727 states and 2173 transitions. [2024-10-23 20:18:58,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-23 20:18:58,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:18:58,805 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:18:58,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 20:18:58,806 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:18:58,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:18:58,806 INFO L85 PathProgramCache]: Analyzing trace with hash 833176865, now seen corresponding path program 1 times [2024-10-23 20:18:58,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:18:58,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449844611] [2024-10-23 20:18:58,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:58,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:18:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:58,866 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-23 20:18:58,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:18:58,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449844611] [2024-10-23 20:18:58,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449844611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:18:58,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:18:58,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:18:58,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487774953] [2024-10-23 20:18:58,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:18:58,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:18:58,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:18:58,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:18:58,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:58,868 INFO L87 Difference]: Start difference. First operand 1727 states and 2173 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:59,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:18:59,216 INFO L93 Difference]: Finished difference Result 4713 states and 5890 transitions. [2024-10-23 20:18:59,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:18:59,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 168 [2024-10-23 20:18:59,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:18:59,223 INFO L225 Difference]: With dead ends: 4713 [2024-10-23 20:18:59,223 INFO L226 Difference]: Without dead ends: 2987 [2024-10-23 20:18:59,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:59,226 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 179 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 20:18:59,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 77 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 20:18:59,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2024-10-23 20:18:59,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2987. [2024-10-23 20:18:59,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2987 states, 2986 states have (on average 1.2012726054922973) internal successors, (3587), 2986 states have internal predecessors, (3587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:59,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2987 states to 2987 states and 3587 transitions. [2024-10-23 20:18:59,284 INFO L78 Accepts]: Start accepts. Automaton has 2987 states and 3587 transitions. Word has length 168 [2024-10-23 20:18:59,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:18:59,285 INFO L471 AbstractCegarLoop]: Abstraction has 2987 states and 3587 transitions. [2024-10-23 20:18:59,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:59,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2987 states and 3587 transitions. [2024-10-23 20:18:59,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-23 20:18:59,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:18:59,289 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:18:59,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-23 20:18:59,290 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:18:59,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:18:59,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1080052150, now seen corresponding path program 1 times [2024-10-23 20:18:59,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:18:59,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124801166] [2024-10-23 20:18:59,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:59,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:18:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:59,458 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-23 20:18:59,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:18:59,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124801166] [2024-10-23 20:18:59,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124801166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:18:59,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:18:59,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:18:59,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396502850] [2024-10-23 20:18:59,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:18:59,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:18:59,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:18:59,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:18:59,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:59,461 INFO L87 Difference]: Start difference. First operand 2987 states and 3587 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:59,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:18:59,799 INFO L93 Difference]: Finished difference Result 6535 states and 7785 transitions. [2024-10-23 20:18:59,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:18:59,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 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 197 [2024-10-23 20:18:59,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:18:59,806 INFO L225 Difference]: With dead ends: 6535 [2024-10-23 20:18:59,806 INFO L226 Difference]: Without dead ends: 2984 [2024-10-23 20:18:59,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:59,809 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 159 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 20:18:59,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 48 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 20:18:59,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states. [2024-10-23 20:18:59,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 2983. [2024-10-23 20:18:59,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2983 states, 2982 states have (on average 1.1210596914822266) internal successors, (3343), 2982 states have internal predecessors, (3343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:59,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 3343 transitions. [2024-10-23 20:18:59,840 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 3343 transitions. Word has length 197 [2024-10-23 20:18:59,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:18:59,840 INFO L471 AbstractCegarLoop]: Abstraction has 2983 states and 3343 transitions. [2024-10-23 20:18:59,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:59,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 3343 transitions. [2024-10-23 20:18:59,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-23 20:18:59,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:18:59,844 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:18:59,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-23 20:18:59,845 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:18:59,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:18:59,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1249979008, now seen corresponding path program 1 times [2024-10-23 20:18:59,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:18:59,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028438308] [2024-10-23 20:18:59,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:59,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:18:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:59,919 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-23 20:18:59,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:18:59,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028438308] [2024-10-23 20:18:59,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028438308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:18:59,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:18:59,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:18:59,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872133359] [2024-10-23 20:18:59,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:18:59,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:18:59,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:18:59,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:18:59,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:59,922 INFO L87 Difference]: Start difference. First operand 2983 states and 3343 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:00,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:19:00,242 INFO L93 Difference]: Finished difference Result 6252 states and 6987 transitions. [2024-10-23 20:19:00,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:19:00,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 201 [2024-10-23 20:19:00,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:19:00,249 INFO L225 Difference]: With dead ends: 6252 [2024-10-23 20:19:00,250 INFO L226 Difference]: Without dead ends: 3130 [2024-10-23 20:19:00,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:19:00,253 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 140 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 20:19:00,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 239 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 20:19:00,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3130 states. [2024-10-23 20:19:00,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3130 to 2982. [2024-10-23 20:19:00,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2982 states, 2981 states have (on average 1.0939282120093927) internal successors, (3261), 2981 states have internal predecessors, (3261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:00,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2982 states to 2982 states and 3261 transitions. [2024-10-23 20:19:00,288 INFO L78 Accepts]: Start accepts. Automaton has 2982 states and 3261 transitions. Word has length 201 [2024-10-23 20:19:00,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:19:00,288 INFO L471 AbstractCegarLoop]: Abstraction has 2982 states and 3261 transitions. [2024-10-23 20:19:00,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:00,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2982 states and 3261 transitions. [2024-10-23 20:19:00,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-23 20:19:00,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:19:00,293 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 20:19:00,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-23 20:19:00,293 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:19:00,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:19:00,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1884058015, now seen corresponding path program 1 times [2024-10-23 20:19:00,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:19:00,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397059870] [2024-10-23 20:19:00,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:19:00,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:19:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:19:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 68 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:19:00,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:19:00,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397059870] [2024-10-23 20:19:00,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397059870] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:19:00,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956601450] [2024-10-23 20:19:00,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:19:00,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:19:00,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:19:00,646 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 20:19:00,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-23 20:19:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:19:00,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 20:19:00,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:19:00,937 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-10-23 20:19:00,938 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:19:00,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956601450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:19:00,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:19:00,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-23 20:19:00,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887011265] [2024-10-23 20:19:00,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:19:00,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:19:00,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:19:00,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:19:00,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-23 20:19:00,939 INFO L87 Difference]: Start difference. First operand 2982 states and 3261 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:01,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:19:01,262 INFO L93 Difference]: Finished difference Result 5959 states and 6518 transitions. [2024-10-23 20:19:01,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:19:01,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 223 [2024-10-23 20:19:01,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:19:01,264 INFO L225 Difference]: With dead ends: 5959 [2024-10-23 20:19:01,264 INFO L226 Difference]: Without dead ends: 0 [2024-10-23 20:19:01,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-23 20:19:01,268 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 44 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 20:19:01,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 52 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 20:19:01,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-23 20:19:01,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-23 20:19:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:01,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-23 20:19:01,269 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 223 [2024-10-23 20:19:01,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:19:01,270 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-23 20:19:01,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:19:01,270 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-23 20:19:01,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-23 20:19:01,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 20:19:01,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-23 20:19:01,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-23 20:19:01,479 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:19:01,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-23 20:19:01,638 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 20:19:01,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:19:01 BoogieIcfgContainer [2024-10-23 20:19:01,649 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 20:19:01,650 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 20:19:01,650 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 20:19:01,650 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 20:19:01,650 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:18:55" (3/4) ... [2024-10-23 20:19:01,652 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-23 20:19:01,662 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-23 20:19:01,663 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-23 20:19:01,663 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-23 20:19:01,664 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-23 20:19:01,815 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 20:19:01,815 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-23 20:19:01,815 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 20:19:01,816 INFO L158 Benchmark]: Toolchain (without parser) took 7944.62ms. Allocated memory was 253.8MB in the beginning and 421.5MB in the end (delta: 167.8MB). Free memory was 181.0MB in the beginning and 381.8MB in the end (delta: -200.8MB). Peak memory consumption was 172.5MB. Max. memory is 16.1GB. [2024-10-23 20:19:01,816 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory is still 94.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-23 20:19:01,816 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.53ms. Allocated memory is still 253.8MB. Free memory was 180.4MB in the beginning and 151.9MB in the end (delta: 28.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-23 20:19:01,817 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.70ms. Allocated memory is still 253.8MB. Free memory was 151.9MB in the beginning and 146.8MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-23 20:19:01,817 INFO L158 Benchmark]: Boogie Preprocessor took 101.76ms. Allocated memory is still 253.8MB. Free memory was 146.8MB in the beginning and 141.4MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-23 20:19:01,817 INFO L158 Benchmark]: RCFGBuilder took 790.22ms. Allocated memory is still 253.8MB. Free memory was 141.4MB in the beginning and 191.4MB in the end (delta: -50.0MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2024-10-23 20:19:01,817 INFO L158 Benchmark]: TraceAbstraction took 6317.39ms. Allocated memory was 253.8MB in the beginning and 350.2MB in the end (delta: 96.5MB). Free memory was 190.4MB in the beginning and 117.6MB in the end (delta: 72.8MB). Peak memory consumption was 170.3MB. Max. memory is 16.1GB. [2024-10-23 20:19:01,817 INFO L158 Benchmark]: Witness Printer took 165.58ms. Allocated memory was 350.2MB in the beginning and 421.5MB in the end (delta: 71.3MB). Free memory was 117.6MB in the beginning and 381.8MB in the end (delta: -264.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-23 20:19:01,819 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.12ms. Allocated memory is still 127.9MB. Free memory is still 94.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.53ms. Allocated memory is still 253.8MB. Free memory was 180.4MB in the beginning and 151.9MB in the end (delta: 28.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.70ms. Allocated memory is still 253.8MB. Free memory was 151.9MB in the beginning and 146.8MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.76ms. Allocated memory is still 253.8MB. Free memory was 146.8MB in the beginning and 141.4MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 790.22ms. Allocated memory is still 253.8MB. Free memory was 141.4MB in the beginning and 191.4MB in the end (delta: -50.0MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6317.39ms. Allocated memory was 253.8MB in the beginning and 350.2MB in the end (delta: 96.5MB). Free memory was 190.4MB in the beginning and 117.6MB in the end (delta: 72.8MB). Peak memory consumption was 170.3MB. Max. memory is 16.1GB. * Witness Printer took 165.58ms. Allocated memory was 350.2MB in the beginning and 421.5MB in the end (delta: 71.3MB). Free memory was 117.6MB in the beginning and 381.8MB in the end (delta: -264.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 560]: 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, 165 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1117 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1117 mSDsluCounter, 1241 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 600 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3217 IncrementalHoareTripleChecker+Invalid, 3817 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 600 mSolverCounterUnsat, 1107 mSDtfsCounter, 3217 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 248 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2987occurred in iteration=7, InterpolantAutomatonStates: 29, 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, 10 MinimizatonAttempts, 721 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1832 NumberOfCodeBlocks, 1832 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1821 ConstructedInterpolants, 0 QuantifiedInterpolants, 4727 SizeOfPredicates, 0 NumberOfNonLiveVariables, 347 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 608/666 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: (((((((((a11 == 0) && (a19 == 1)) || ((8 <= a17) && (a28 == 10))) || ((a28 == 10) && (a11 == 0))) || (a28 <= 9)) || ((a28 == 10) && (a25 != 1))) || ((a25 != 1) && (a19 == 1))) || ((a11 == 0) && (a25 != 1))) || ((8 <= a17) && (a19 == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-23 20:19:01,851 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