./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label08.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label08.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 83003e08d0b0727d8396cfdc2be95d1bd0956c017aa98740983eff57678f4a43 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 18:37:24,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 18:37:24,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 18:37:24,602 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 18:37:24,604 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 18:37:24,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 18:37:24,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 18:37:24,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 18:37:24,640 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 18:37:24,642 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 18:37:24,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 18:37:24,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 18:37:24,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 18:37:24,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 18:37:24,643 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 18:37:24,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 18:37:24,644 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 18:37:24,646 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 18:37:24,646 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 18:37:24,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 18:37:24,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 18:37:24,649 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 18:37:24,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 18:37:24,650 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 18:37:24,650 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 18:37:24,650 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 18:37:24,651 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 18:37:24,651 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 18:37:24,651 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 18:37:24,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 18:37:24,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 18:37:24,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 18:37:24,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:37:24,653 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 18:37:24,653 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 18:37:24,653 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 18:37:24,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 18:37:24,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 18:37:24,654 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 18:37:24,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 18:37:24,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 18:37:24,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 18:37:24,655 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 -> 83003e08d0b0727d8396cfdc2be95d1bd0956c017aa98740983eff57678f4a43 [2024-11-09 18:37:24,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 18:37:24,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 18:37:24,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 18:37:24,946 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 18:37:24,946 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 18:37:24,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label08.c [2024-11-09 18:37:26,451 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 18:37:26,724 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 18:37:26,724 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label08.c [2024-11-09 18:37:26,739 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e52cf745/cd75c67e300f4546a438f8da3d2677ba/FLAGdc48ad40f [2024-11-09 18:37:26,762 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e52cf745/cd75c67e300f4546a438f8da3d2677ba [2024-11-09 18:37:26,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 18:37:26,767 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 18:37:26,768 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 18:37:26,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 18:37:26,775 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 18:37:26,776 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:37:26" (1/1) ... [2024-11-09 18:37:26,776 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@239dee77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:26, skipping insertion in model container [2024-11-09 18:37:26,777 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:37:26" (1/1) ... [2024-11-09 18:37:26,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 18:37:27,248 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label08.c[19283,19296] [2024-11-09 18:37:27,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:37:27,304 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 18:37:27,429 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label08.c[19283,19296] [2024-11-09 18:37:27,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 18:37:27,463 INFO L204 MainTranslator]: Completed translation [2024-11-09 18:37:27,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:27 WrapperNode [2024-11-09 18:37:27,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 18:37:27,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 18:37:27,465 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 18:37:27,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 18:37:27,472 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:27" (1/1) ... [2024-11-09 18:37:27,493 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:27" (1/1) ... [2024-11-09 18:37:27,547 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 668 [2024-11-09 18:37:27,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 18:37:27,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 18:37:27,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 18:37:27,549 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 18:37:27,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:27" (1/1) ... [2024-11-09 18:37:27,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:27" (1/1) ... [2024-11-09 18:37:27,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:27" (1/1) ... [2024-11-09 18:37:27,591 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 18:37:27,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:27" (1/1) ... [2024-11-09 18:37:27,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:27" (1/1) ... [2024-11-09 18:37:27,609 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:27" (1/1) ... [2024-11-09 18:37:27,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:27" (1/1) ... [2024-11-09 18:37:27,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:27" (1/1) ... [2024-11-09 18:37:27,622 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:27" (1/1) ... [2024-11-09 18:37:27,639 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 18:37:27,640 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 18:37:27,645 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 18:37:27,645 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 18:37:27,646 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:27" (1/1) ... [2024-11-09 18:37:27,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 18:37:27,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:37:27,681 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 18:37:27,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 18:37:27,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 18:37:27,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 18:37:27,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 18:37:27,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 18:37:27,819 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 18:37:27,822 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 18:37:28,876 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-09 18:37:28,876 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 18:37:28,906 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 18:37:28,907 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 18:37:28,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:37:28 BoogieIcfgContainer [2024-11-09 18:37:28,908 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 18:37:28,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 18:37:28,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 18:37:28,915 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 18:37:28,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:37:26" (1/3) ... [2024-11-09 18:37:28,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13ad5963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:37:28, skipping insertion in model container [2024-11-09 18:37:28,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:37:27" (2/3) ... [2024-11-09 18:37:28,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13ad5963 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:37:28, skipping insertion in model container [2024-11-09 18:37:28,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:37:28" (3/3) ... [2024-11-09 18:37:28,918 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label08.c [2024-11-09 18:37:28,937 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 18:37:28,938 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 18:37:29,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 18:37:29,024 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;@68cb2106, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 18:37:29,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 18:37:29,031 INFO L276 IsEmpty]: Start isEmpty. Operand has 230 states, 228 states have (on average 1.6578947368421053) internal successors, (378), 229 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:29,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 18:37:29,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:29,050 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] [2024-11-09 18:37:29,051 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:29,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:29,057 INFO L85 PathProgramCache]: Analyzing trace with hash 750339727, now seen corresponding path program 1 times [2024-11-09 18:37:29,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:29,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145350514] [2024-11-09 18:37:29,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:29,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:29,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:29,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145350514] [2024-11-09 18:37:29,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145350514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:29,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:29,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:37:29,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506655603] [2024-11-09 18:37:29,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:29,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:29,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:29,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:29,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:29,707 INFO L87 Difference]: Start difference. First operand has 230 states, 228 states have (on average 1.6578947368421053) internal successors, (378), 229 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:30,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:30,493 INFO L93 Difference]: Finished difference Result 636 states and 1076 transitions. [2024-11-09 18:37:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:30,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-11-09 18:37:30,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:30,512 INFO L225 Difference]: With dead ends: 636 [2024-11-09 18:37:30,513 INFO L226 Difference]: Without dead ends: 321 [2024-11-09 18:37:30,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:30,522 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 108 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:30,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 123 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 18:37:30,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-09 18:37:30,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2024-11-09 18:37:30,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 1.46875) internal successors, (470), 320 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:30,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 470 transitions. [2024-11-09 18:37:30,585 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 470 transitions. Word has length 124 [2024-11-09 18:37:30,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:30,586 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 470 transitions. [2024-11-09 18:37:30,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:30,586 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 470 transitions. [2024-11-09 18:37:30,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 18:37:30,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:30,590 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] [2024-11-09 18:37:30,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 18:37:30,591 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:30,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:30,592 INFO L85 PathProgramCache]: Analyzing trace with hash -771390637, now seen corresponding path program 1 times [2024-11-09 18:37:30,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:30,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857554618] [2024-11-09 18:37:30,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:30,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:31,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:31,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857554618] [2024-11-09 18:37:31,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857554618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:31,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:31,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:37:31,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772409773] [2024-11-09 18:37:31,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:31,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 18:37:31,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:31,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 18:37:31,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:37:31,058 INFO L87 Difference]: Start difference. First operand 321 states and 470 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:31,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:31,830 INFO L93 Difference]: Finished difference Result 1008 states and 1517 transitions. [2024-11-09 18:37:31,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 18:37:31,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2024-11-09 18:37:31,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:31,834 INFO L225 Difference]: With dead ends: 1008 [2024-11-09 18:37:31,834 INFO L226 Difference]: Without dead ends: 605 [2024-11-09 18:37:31,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 18:37:31,837 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 170 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:31,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 121 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 18:37:31,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-09 18:37:31,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2024-11-09 18:37:31,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 604 states have (on average 1.3543046357615893) internal successors, (818), 604 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:31,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 818 transitions. [2024-11-09 18:37:31,874 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 818 transitions. Word has length 129 [2024-11-09 18:37:31,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:31,874 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 818 transitions. [2024-11-09 18:37:31,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:31,875 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 818 transitions. [2024-11-09 18:37:31,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 18:37:31,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:31,883 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-11-09 18:37:31,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 18:37:31,883 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:31,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:31,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1620882389, now seen corresponding path program 1 times [2024-11-09 18:37:31,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:31,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521084168] [2024-11-09 18:37:31,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:31,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:32,111 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:32,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:32,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521084168] [2024-11-09 18:37:32,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521084168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:32,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:32,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:37:32,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226641465] [2024-11-09 18:37:32,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:32,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:32,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:32,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:32,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:32,115 INFO L87 Difference]: Start difference. First operand 605 states and 818 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-11-09 18:37:32,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:32,569 INFO L93 Difference]: Finished difference Result 1796 states and 2433 transitions. [2024-11-09 18:37:32,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:32,569 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 143 [2024-11-09 18:37:32,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:32,573 INFO L225 Difference]: With dead ends: 1796 [2024-11-09 18:37:32,574 INFO L226 Difference]: Without dead ends: 1193 [2024-11-09 18:37:32,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:32,577 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 159 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:32,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 103 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:37:32,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-11-09 18:37:32,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1182. [2024-11-09 18:37:32,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 1.309060118543607) internal successors, (1546), 1181 states have internal predecessors, (1546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1546 transitions. [2024-11-09 18:37:32,622 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1546 transitions. Word has length 143 [2024-11-09 18:37:32,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:32,623 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1546 transitions. [2024-11-09 18:37:32,623 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-11-09 18:37:32,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1546 transitions. [2024-11-09 18:37:32,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 18:37:32,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:32,628 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:37:32,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 18:37:32,629 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:32,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:32,630 INFO L85 PathProgramCache]: Analyzing trace with hash -945308644, now seen corresponding path program 1 times [2024-11-09 18:37:32,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:32,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985017302] [2024-11-09 18:37:32,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:32,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:32,747 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:32,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:32,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985017302] [2024-11-09 18:37:32,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985017302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:32,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:32,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 18:37:32,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588169971] [2024-11-09 18:37:32,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:32,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:32,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:32,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:32,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:32,750 INFO L87 Difference]: Start difference. First operand 1182 states and 1546 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:33,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:33,215 INFO L93 Difference]: Finished difference Result 3354 states and 4412 transitions. [2024-11-09 18:37:33,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:33,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2024-11-09 18:37:33,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:33,224 INFO L225 Difference]: With dead ends: 3354 [2024-11-09 18:37:33,225 INFO L226 Difference]: Without dead ends: 2174 [2024-11-09 18:37:33,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:33,231 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 124 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:33,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 133 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:37:33,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2174 states. [2024-11-09 18:37:33,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2174 to 2171. [2024-11-09 18:37:33,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2171 states, 2170 states have (on average 1.1981566820276497) internal successors, (2600), 2170 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:33,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 2600 transitions. [2024-11-09 18:37:33,296 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 2600 transitions. Word has length 149 [2024-11-09 18:37:33,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:33,296 INFO L471 AbstractCegarLoop]: Abstraction has 2171 states and 2600 transitions. [2024-11-09 18:37:33,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:33,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 2600 transitions. [2024-11-09 18:37:33,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 18:37:33,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:33,303 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:37:33,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 18:37:33,304 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:33,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:33,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1228022533, now seen corresponding path program 1 times [2024-11-09 18:37:33,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:33,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826289403] [2024-11-09 18:37:33,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:33,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:33,741 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 18:37:33,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:33,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826289403] [2024-11-09 18:37:33,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826289403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 18:37:33,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522836641] [2024-11-09 18:37:33,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:33,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:37:33,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 18:37:33,746 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 18:37:33,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 18:37:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:33,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 18:37:33,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 18:37:34,051 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:37:34,052 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 18:37:34,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522836641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:34,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 18:37:34,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 18:37:34,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412832950] [2024-11-09 18:37:34,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:34,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:34,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:34,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:34,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:37:34,054 INFO L87 Difference]: Start difference. First operand 2171 states and 2600 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:34,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:34,548 INFO L93 Difference]: Finished difference Result 5474 states and 6686 transitions. [2024-11-09 18:37:34,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:34,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 153 [2024-11-09 18:37:34,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:34,559 INFO L225 Difference]: With dead ends: 5474 [2024-11-09 18:37:34,560 INFO L226 Difference]: Without dead ends: 3305 [2024-11-09 18:37:34,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 152 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-11-09 18:37:34,564 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 57 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:34,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 71 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 18:37:34,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3305 states. [2024-11-09 18:37:34,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3305 to 3299. [2024-11-09 18:37:34,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3299 states, 3298 states have (on average 1.2177077016373559) internal successors, (4016), 3298 states have internal predecessors, (4016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3299 states to 3299 states and 4016 transitions. [2024-11-09 18:37:34,617 INFO L78 Accepts]: Start accepts. Automaton has 3299 states and 4016 transitions. Word has length 153 [2024-11-09 18:37:34,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:34,618 INFO L471 AbstractCegarLoop]: Abstraction has 3299 states and 4016 transitions. [2024-11-09 18:37:34,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand 3299 states and 4016 transitions. [2024-11-09 18:37:34,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-09 18:37:34,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:34,625 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:37:34,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 18:37:34,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 18:37:34,826 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:34,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:34,827 INFO L85 PathProgramCache]: Analyzing trace with hash -699343484, now seen corresponding path program 1 times [2024-11-09 18:37:34,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:34,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040206854] [2024-11-09 18:37:34,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:34,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:35,033 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 18:37:35,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:35,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040206854] [2024-11-09 18:37:35,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040206854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:35,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:35,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:37:35,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150589209] [2024-11-09 18:37:35,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:35,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:35,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:35,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:35,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:35,036 INFO L87 Difference]: Start difference. First operand 3299 states and 4016 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:35,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:35,501 INFO L93 Difference]: Finished difference Result 7587 states and 9271 transitions. [2024-11-09 18:37:35,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:35,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 227 [2024-11-09 18:37:35,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:35,516 INFO L225 Difference]: With dead ends: 7587 [2024-11-09 18:37:35,517 INFO L226 Difference]: Without dead ends: 3726 [2024-11-09 18:37:35,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:35,525 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 94 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:35,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 248 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:37:35,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3726 states. [2024-11-09 18:37:35,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3726 to 3726. [2024-11-09 18:37:35,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3726 states, 3725 states have (on average 1.0987919463087248) internal successors, (4093), 3725 states have internal predecessors, (4093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:35,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3726 states to 3726 states and 4093 transitions. [2024-11-09 18:37:35,586 INFO L78 Accepts]: Start accepts. Automaton has 3726 states and 4093 transitions. Word has length 227 [2024-11-09 18:37:35,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:35,586 INFO L471 AbstractCegarLoop]: Abstraction has 3726 states and 4093 transitions. [2024-11-09 18:37:35,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:35,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3726 states and 4093 transitions. [2024-11-09 18:37:35,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-09 18:37:35,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:35,594 INFO L215 NwaCegarLoop]: trace histogram [5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:37:35,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 18:37:35,595 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:35,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:35,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1626855934, now seen corresponding path program 1 times [2024-11-09 18:37:35,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:35,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502380032] [2024-11-09 18:37:35,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:35,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:36,007 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-09 18:37:36,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:36,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502380032] [2024-11-09 18:37:36,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502380032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:36,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:36,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 18:37:36,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338373628] [2024-11-09 18:37:36,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:36,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 18:37:36,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:36,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 18:37:36,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 18:37:36,012 INFO L87 Difference]: Start difference. First operand 3726 states and 4093 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:36,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:36,826 INFO L93 Difference]: Finished difference Result 7732 states and 8480 transitions. [2024-11-09 18:37:36,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 18:37:36,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 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 251 [2024-11-09 18:37:36,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:36,840 INFO L225 Difference]: With dead ends: 7732 [2024-11-09 18:37:36,841 INFO L226 Difference]: Without dead ends: 4008 [2024-11-09 18:37:36,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 18:37:36,847 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 328 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:36,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 151 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 18:37:36,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4008 states. [2024-11-09 18:37:36,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4008 to 3867. [2024-11-09 18:37:36,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3867 states, 3866 states have (on average 1.0959648215209519) internal successors, (4237), 3866 states have internal predecessors, (4237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:36,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3867 states to 3867 states and 4237 transitions. [2024-11-09 18:37:36,916 INFO L78 Accepts]: Start accepts. Automaton has 3867 states and 4237 transitions. Word has length 251 [2024-11-09 18:37:36,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:36,917 INFO L471 AbstractCegarLoop]: Abstraction has 3867 states and 4237 transitions. [2024-11-09 18:37:36,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:36,917 INFO L276 IsEmpty]: Start isEmpty. Operand 3867 states and 4237 transitions. [2024-11-09 18:37:36,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2024-11-09 18:37:36,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:36,925 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:37:36,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 18:37:36,925 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:36,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:36,926 INFO L85 PathProgramCache]: Analyzing trace with hash -509855236, now seen corresponding path program 1 times [2024-11-09 18:37:36,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:36,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588048615] [2024-11-09 18:37:36,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:36,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-09 18:37:37,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:37,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588048615] [2024-11-09 18:37:37,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588048615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:37,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:37,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:37:37,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556166499] [2024-11-09 18:37:37,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:37,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:37,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:37,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:37,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:37,094 INFO L87 Difference]: Start difference. First operand 3867 states and 4237 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:37,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:37,553 INFO L93 Difference]: Finished difference Result 8147 states and 9039 transitions. [2024-11-09 18:37:37,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:37,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 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 291 [2024-11-09 18:37:37,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:37,563 INFO L225 Difference]: With dead ends: 8147 [2024-11-09 18:37:37,564 INFO L226 Difference]: Without dead ends: 3146 [2024-11-09 18:37:37,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:37,570 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 102 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:37,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 258 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:37:37,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3146 states. [2024-11-09 18:37:37,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3146 to 3004. [2024-11-09 18:37:37,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3004 states, 3003 states have (on average 1.0825840825840827) internal successors, (3251), 3003 states have internal predecessors, (3251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:37,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 3251 transitions. [2024-11-09 18:37:37,618 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 3251 transitions. Word has length 291 [2024-11-09 18:37:37,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:37,618 INFO L471 AbstractCegarLoop]: Abstraction has 3004 states and 3251 transitions. [2024-11-09 18:37:37,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:37,619 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 3251 transitions. [2024-11-09 18:37:37,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2024-11-09 18:37:37,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:37,626 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2024-11-09 18:37:37,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 18:37:37,627 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:37,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:37,627 INFO L85 PathProgramCache]: Analyzing trace with hash -2101980381, now seen corresponding path program 1 times [2024-11-09 18:37:37,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:37,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081859046] [2024-11-09 18:37:37,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:37,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:37,801 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 193 trivial. 0 not checked. [2024-11-09 18:37:37,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:37,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081859046] [2024-11-09 18:37:37,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081859046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:37,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:37,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:37:37,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848354573] [2024-11-09 18:37:37,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:37,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:37,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:37,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:37,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:37,807 INFO L87 Difference]: Start difference. First operand 3004 states and 3251 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:38,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:38,210 INFO L93 Difference]: Finished difference Result 6854 states and 7495 transitions. [2024-11-09 18:37:38,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:38,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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 308 [2024-11-09 18:37:38,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:38,222 INFO L225 Difference]: With dead ends: 6854 [2024-11-09 18:37:38,222 INFO L226 Difference]: Without dead ends: 3852 [2024-11-09 18:37:38,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:38,228 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 134 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:38,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 208 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 18:37:38,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3852 states. [2024-11-09 18:37:38,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3852 to 3427. [2024-11-09 18:37:38,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3427 states, 3426 states have (on average 1.0890251021599533) internal successors, (3731), 3426 states have internal predecessors, (3731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:38,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3427 states to 3427 states and 3731 transitions. [2024-11-09 18:37:38,316 INFO L78 Accepts]: Start accepts. Automaton has 3427 states and 3731 transitions. Word has length 308 [2024-11-09 18:37:38,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:38,317 INFO L471 AbstractCegarLoop]: Abstraction has 3427 states and 3731 transitions. [2024-11-09 18:37:38,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 3427 states and 3731 transitions. [2024-11-09 18:37:38,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-11-09 18:37:38,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:38,326 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 18:37:38,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 18:37:38,326 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:38,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:38,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1659591510, now seen corresponding path program 1 times [2024-11-09 18:37:38,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:38,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569412699] [2024-11-09 18:37:38,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:38,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:38,475 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 313 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2024-11-09 18:37:38,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:38,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569412699] [2024-11-09 18:37:38,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569412699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:38,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:38,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:37:38,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609977542] [2024-11-09 18:37:38,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:38,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:38,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:38,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:38,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:38,478 INFO L87 Difference]: Start difference. First operand 3427 states and 3731 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:38,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:38,851 INFO L93 Difference]: Finished difference Result 7276 states and 7909 transitions. [2024-11-09 18:37:38,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:38,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 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 331 [2024-11-09 18:37:38,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:38,864 INFO L225 Difference]: With dead ends: 7276 [2024-11-09 18:37:38,864 INFO L226 Difference]: Without dead ends: 3567 [2024-11-09 18:37:38,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:38,870 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 161 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:38,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 73 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:37:38,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3567 states. [2024-11-09 18:37:38,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3567 to 3426. [2024-11-09 18:37:38,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3426 states, 3425 states have (on average 1.0764963503649636) internal successors, (3687), 3425 states have internal predecessors, (3687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:38,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3426 states to 3426 states and 3687 transitions. [2024-11-09 18:37:38,926 INFO L78 Accepts]: Start accepts. Automaton has 3426 states and 3687 transitions. Word has length 331 [2024-11-09 18:37:38,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:38,927 INFO L471 AbstractCegarLoop]: Abstraction has 3426 states and 3687 transitions. [2024-11-09 18:37:38,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:38,927 INFO L276 IsEmpty]: Start isEmpty. Operand 3426 states and 3687 transitions. [2024-11-09 18:37:38,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-09 18:37:38,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:38,936 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-09 18:37:38,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 18:37:38,937 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:38,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:38,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1183884481, now seen corresponding path program 1 times [2024-11-09 18:37:38,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:38,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355891061] [2024-11-09 18:37:38,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:38,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:39,107 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-09 18:37:39,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:39,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355891061] [2024-11-09 18:37:39,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355891061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:39,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:39,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:37:39,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075912048] [2024-11-09 18:37:39,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:39,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:39,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:39,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:39,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:39,109 INFO L87 Difference]: Start difference. First operand 3426 states and 3687 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:39,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:39,483 INFO L93 Difference]: Finished difference Result 7276 states and 7816 transitions. [2024-11-09 18:37:39,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:39,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 332 [2024-11-09 18:37:39,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:39,503 INFO L225 Difference]: With dead ends: 7276 [2024-11-09 18:37:39,503 INFO L226 Difference]: Without dead ends: 3426 [2024-11-09 18:37:39,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:39,511 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 88 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:39,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 241 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:37:39,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3426 states. [2024-11-09 18:37:39,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 3421. [2024-11-09 18:37:39,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3421 states, 3420 states have (on average 1.0549707602339182) internal successors, (3608), 3420 states have internal predecessors, (3608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3421 states to 3421 states and 3608 transitions. [2024-11-09 18:37:39,567 INFO L78 Accepts]: Start accepts. Automaton has 3421 states and 3608 transitions. Word has length 332 [2024-11-09 18:37:39,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:39,567 INFO L471 AbstractCegarLoop]: Abstraction has 3421 states and 3608 transitions. [2024-11-09 18:37:39,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:39,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3421 states and 3608 transitions. [2024-11-09 18:37:39,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-11-09 18:37:39,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 18:37:39,576 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:37:39,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 18:37:39,577 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 18:37:39,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 18:37:39,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1048604651, now seen corresponding path program 1 times [2024-11-09 18:37:39,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 18:37:39,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384919577] [2024-11-09 18:37:39,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 18:37:39,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 18:37:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 18:37:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-09 18:37:39,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 18:37:39,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384919577] [2024-11-09 18:37:39,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384919577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 18:37:39,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 18:37:39,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 18:37:39,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929874009] [2024-11-09 18:37:39,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 18:37:39,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 18:37:39,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 18:37:39,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 18:37:39,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:39,784 INFO L87 Difference]: Start difference. First operand 3421 states and 3608 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:40,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 18:37:40,127 INFO L93 Difference]: Finished difference Result 5411 states and 5679 transitions. [2024-11-09 18:37:40,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 18:37:40,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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 349 [2024-11-09 18:37:40,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 18:37:40,128 INFO L225 Difference]: With dead ends: 5411 [2024-11-09 18:37:40,128 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 18:37:40,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 18:37:40,132 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 128 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 18:37:40,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 204 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 18:37:40,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 18:37:40,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 18:37:40,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:40,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 18:37:40,134 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 349 [2024-11-09 18:37:40,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 18:37:40,134 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 18:37:40,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 18:37:40,136 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 18:37:40,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 18:37:40,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 18:37:40,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 18:37:40,143 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 18:37:40,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 18:37:40,519 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 18:37:40,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:37:40 BoogieIcfgContainer [2024-11-09 18:37:40,538 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 18:37:40,539 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 18:37:40,542 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 18:37:40,542 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 18:37:40,543 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 06:37:28" (3/4) ... [2024-11-09 18:37:40,545 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-09 18:37:40,568 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 18:37:40,569 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 18:37:40,570 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 18:37:40,572 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 18:37:40,714 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 18:37:40,715 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 18:37:40,715 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 18:37:40,715 INFO L158 Benchmark]: Toolchain (without parser) took 13948.70ms. Allocated memory was 178.3MB in the beginning and 402.7MB in the end (delta: 224.4MB). Free memory was 103.2MB in the beginning and 211.1MB in the end (delta: -107.9MB). Peak memory consumption was 118.2MB. Max. memory is 16.1GB. [2024-11-09 18:37:40,716 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 178.3MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 18:37:40,716 INFO L158 Benchmark]: CACSL2BoogieTranslator took 695.91ms. Allocated memory is still 178.3MB. Free memory was 103.0MB in the beginning and 123.3MB in the end (delta: -20.3MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2024-11-09 18:37:40,716 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.38ms. Allocated memory is still 178.3MB. Free memory was 123.3MB in the beginning and 117.9MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 18:37:40,716 INFO L158 Benchmark]: Boogie Preprocessor took 90.80ms. Allocated memory is still 178.3MB. Free memory was 117.9MB in the beginning and 113.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 18:37:40,717 INFO L158 Benchmark]: IcfgBuilder took 1268.12ms. Allocated memory was 178.3MB in the beginning and 220.2MB in the end (delta: 41.9MB). Free memory was 113.7MB in the beginning and 169.8MB in the end (delta: -56.1MB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. [2024-11-09 18:37:40,717 INFO L158 Benchmark]: TraceAbstraction took 11627.34ms. Allocated memory was 220.2MB in the beginning and 402.7MB in the end (delta: 182.5MB). Free memory was 168.7MB in the beginning and 223.7MB in the end (delta: -55.0MB). Peak memory consumption was 127.5MB. Max. memory is 16.1GB. [2024-11-09 18:37:40,717 INFO L158 Benchmark]: Witness Printer took 176.08ms. Allocated memory is still 402.7MB. Free memory was 223.7MB in the beginning and 211.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 18:37:40,719 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.19ms. Allocated memory is still 178.3MB. Free memory is still 140.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 695.91ms. Allocated memory is still 178.3MB. Free memory was 103.0MB in the beginning and 123.3MB in the end (delta: -20.3MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.38ms. Allocated memory is still 178.3MB. Free memory was 123.3MB in the beginning and 117.9MB in the end (delta: 5.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.80ms. Allocated memory is still 178.3MB. Free memory was 117.9MB in the beginning and 113.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1268.12ms. Allocated memory was 178.3MB in the beginning and 220.2MB in the end (delta: 41.9MB). Free memory was 113.7MB in the beginning and 169.8MB in the end (delta: -56.1MB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11627.34ms. Allocated memory was 220.2MB in the beginning and 402.7MB in the end (delta: 182.5MB). Free memory was 168.7MB in the beginning and 223.7MB in the end (delta: -55.0MB). Peak memory consumption was 127.5MB. Max. memory is 16.1GB. * Witness Printer took 176.08ms. Allocated memory is still 402.7MB. Free memory was 223.7MB in the beginning and 211.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 548]: 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, 230 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 12, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1653 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1653 mSDsluCounter, 1934 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 299 mSDsCounter, 777 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5113 IncrementalHoareTripleChecker+Invalid, 5890 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 777 mSolverCounterUnsat, 1635 mSDtfsCounter, 5113 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3867occurred in iteration=7, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 874 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2940 NumberOfCodeBlocks, 2940 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2927 ConstructedInterpolants, 0 QuantifiedInterpolants, 7849 SizeOfPredicates, 0 NumberOfNonLiveVariables, 280 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 2584/2602 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]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-09 18:37:40,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE