./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label23.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label23.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 9f1cd2841a16dfe2f8fe839faac013546a2b72431aadffbb7fe449f6c6dcaf65 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-23 20:18:01,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-23 20:18:01,741 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-23 20:18:01,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-23 20:18:01,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-23 20:18:01,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-23 20:18:01,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-23 20:18:01,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-23 20:18:01,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-23 20:18:01,780 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-23 20:18:01,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-23 20:18:01,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-23 20:18:01,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-23 20:18:01,784 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-23 20:18:01,785 INFO L153 SettingsManager]: * Use SBE=true [2024-10-23 20:18:01,785 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-23 20:18:01,786 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-23 20:18:01,786 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-23 20:18:01,786 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-23 20:18:01,786 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-23 20:18:01,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-23 20:18:01,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-23 20:18:01,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-23 20:18:01,788 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-23 20:18:01,788 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-23 20:18:01,789 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-23 20:18:01,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-23 20:18:01,789 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-23 20:18:01,790 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-23 20:18:01,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-23 20:18:01,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-23 20:18:01,791 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-23 20:18:01,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 20:18:01,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-23 20:18:01,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-23 20:18:01,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-23 20:18:01,792 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-23 20:18:01,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-23 20:18:01,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-23 20:18:01,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-23 20:18:01,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-23 20:18:01,794 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-23 20:18:01,794 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 -> 9f1cd2841a16dfe2f8fe839faac013546a2b72431aadffbb7fe449f6c6dcaf65 [2024-10-23 20:18:02,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-23 20:18:02,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-23 20:18:02,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-23 20:18:02,068 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-23 20:18:02,068 INFO L274 PluginConnector]: CDTParser initialized [2024-10-23 20:18:02,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label23.c [2024-10-23 20:18:03,505 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-23 20:18:03,758 INFO L384 CDTParser]: Found 1 translation units. [2024-10-23 20:18:03,758 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label23.c [2024-10-23 20:18:03,785 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a54f299d/d356da507db848b6b31895979a0356c8/FLAG37536a45a [2024-10-23 20:18:03,807 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a54f299d/d356da507db848b6b31895979a0356c8 [2024-10-23 20:18:03,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-23 20:18:03,811 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-23 20:18:03,814 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-23 20:18:03,814 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-23 20:18:03,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-23 20:18:03,821 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:18:03" (1/1) ... [2024-10-23 20:18:03,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49025178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:03, skipping insertion in model container [2024-10-23 20:18:03,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 08:18:03" (1/1) ... [2024-10-23 20:18:03,870 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-23 20:18:04,191 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label23.c[17363,17376] [2024-10-23 20:18:04,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 20:18:04,264 INFO L200 MainTranslator]: Completed pre-run [2024-10-23 20:18:04,342 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label23.c[17363,17376] [2024-10-23 20:18:04,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-23 20:18:04,399 INFO L204 MainTranslator]: Completed translation [2024-10-23 20:18:04,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:04 WrapperNode [2024-10-23 20:18:04,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-23 20:18:04,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-23 20:18:04,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-23 20:18:04,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-23 20:18:04,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:04" (1/1) ... [2024-10-23 20:18:04,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:04" (1/1) ... [2024-10-23 20:18:04,502 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658 [2024-10-23 20:18:04,506 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-23 20:18:04,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-23 20:18:04,507 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-23 20:18:04,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-23 20:18:04,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:04" (1/1) ... [2024-10-23 20:18:04,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:04" (1/1) ... [2024-10-23 20:18:04,529 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:04" (1/1) ... [2024-10-23 20:18:04,561 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-23 20:18:04,562 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:04" (1/1) ... [2024-10-23 20:18:04,562 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:04" (1/1) ... [2024-10-23 20:18:04,590 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:04" (1/1) ... [2024-10-23 20:18:04,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:04" (1/1) ... [2024-10-23 20:18:04,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:04" (1/1) ... [2024-10-23 20:18:04,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:04" (1/1) ... [2024-10-23 20:18:04,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-23 20:18:04,631 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-23 20:18:04,632 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-23 20:18:04,632 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-23 20:18:04,633 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:04" (1/1) ... [2024-10-23 20:18:04,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-23 20:18:04,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:18:04,665 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-23 20:18:04,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-23 20:18:04,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-23 20:18:04,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-23 20:18:04,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-23 20:18:04,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-23 20:18:04,788 INFO L238 CfgBuilder]: Building ICFG [2024-10-23 20:18:04,789 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-23 20:18:05,646 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-10-23 20:18:05,646 INFO L287 CfgBuilder]: Performing block encoding [2024-10-23 20:18:05,707 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-23 20:18:05,708 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-23 20:18:05,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:18:05 BoogieIcfgContainer [2024-10-23 20:18:05,709 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-23 20:18:05,711 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-23 20:18:05,711 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-23 20:18:05,714 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-23 20:18:05,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 08:18:03" (1/3) ... [2024-10-23 20:18:05,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@757f39d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:18:05, skipping insertion in model container [2024-10-23 20:18:05,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 08:18:04" (2/3) ... [2024-10-23 20:18:05,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@757f39d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 08:18:05, skipping insertion in model container [2024-10-23 20:18:05,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:18:05" (3/3) ... [2024-10-23 20:18:05,718 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label23.c [2024-10-23 20:18:05,734 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-23 20:18:05,734 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-23 20:18:05,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-23 20:18:05,815 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;@2e1d6d34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-23 20:18:05,815 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-23 20:18:05,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:05,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-23 20:18:05,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:18:05,831 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] [2024-10-23 20:18:05,831 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:18:05,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:18:05,837 INFO L85 PathProgramCache]: Analyzing trace with hash 228146059, now seen corresponding path program 1 times [2024-10-23 20:18:05,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:18:05,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7458574] [2024-10-23 20:18:05,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:05,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:18:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:06,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:18:06,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:18:06,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7458574] [2024-10-23 20:18:06,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7458574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:18:06,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:18:06,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:18:06,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535170561] [2024-10-23 20:18:06,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:18:06,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-23 20:18:06,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:18:06,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-23 20:18:06,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 20:18:06,349 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.9776119402985075) internal successors, (265), 135 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:06,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:18:06,386 INFO L93 Difference]: Finished difference Result 271 states and 529 transitions. [2024-10-23 20:18:06,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-23 20:18:06,391 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-10-23 20:18:06,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:18:06,398 INFO L225 Difference]: With dead ends: 271 [2024-10-23 20:18:06,399 INFO L226 Difference]: Without dead ends: 134 [2024-10-23 20:18:06,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-23 20:18:06,406 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-23 20:18:06,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-23 20:18:06,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-23 20:18:06,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-10-23 20:18:06,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.5037593984962405) internal successors, (200), 133 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-10-23 20:18:06,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions. [2024-10-23 20:18:06,456 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 94 [2024-10-23 20:18:06,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:18:06,457 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 200 transitions. [2024-10-23 20:18:06,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:06,458 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions. [2024-10-23 20:18:06,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-23 20:18:06,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:18:06,460 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] [2024-10-23 20:18:06,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-23 20:18:06,461 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:18:06,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:18:06,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1778198834, now seen corresponding path program 1 times [2024-10-23 20:18:06,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:18:06,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111974327] [2024-10-23 20:18:06,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:06,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:18:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:18:06,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:18:06,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111974327] [2024-10-23 20:18:06,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111974327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:18:06,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:18:06,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:18:06,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259043810] [2024-10-23 20:18:06,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:18:06,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:18:06,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:18:06,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:18:06,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:06,720 INFO L87 Difference]: Start difference. First operand 134 states and 200 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:07,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:18:07,289 INFO L93 Difference]: Finished difference Result 398 states and 597 transitions. [2024-10-23 20:18:07,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:18:07,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2024-10-23 20:18:07,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:18:07,292 INFO L225 Difference]: With dead ends: 398 [2024-10-23 20:18:07,292 INFO L226 Difference]: Without dead ends: 265 [2024-10-23 20:18:07,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:07,294 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 50 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 20:18:07,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 23 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 20:18:07,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-23 20:18:07,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2024-10-23 20:18:07,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 1.4583333333333333) internal successors, (385), 264 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:07,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 385 transitions. [2024-10-23 20:18:07,313 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 385 transitions. Word has length 94 [2024-10-23 20:18:07,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:18:07,314 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 385 transitions. [2024-10-23 20:18:07,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:07,314 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 385 transitions. [2024-10-23 20:18:07,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-23 20:18:07,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:18:07,316 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-23 20:18:07,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-23 20:18:07,316 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:18:07,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:18:07,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1362079451, now seen corresponding path program 1 times [2024-10-23 20:18:07,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:18:07,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398295048] [2024-10-23 20:18:07,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:07,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:18:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:18:07,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:18:07,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398295048] [2024-10-23 20:18:07,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398295048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:18:07,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:18:07,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:18:07,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236677358] [2024-10-23 20:18:07,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:18:07,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:18:07,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:18:07,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:18:07,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:07,461 INFO L87 Difference]: Start difference. First operand 265 states and 385 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:07,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:18:07,895 INFO L93 Difference]: Finished difference Result 791 states and 1152 transitions. [2024-10-23 20:18:07,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:18:07,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2024-10-23 20:18:07,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:18:07,898 INFO L225 Difference]: With dead ends: 791 [2024-10-23 20:18:07,899 INFO L226 Difference]: Without dead ends: 527 [2024-10-23 20:18:07,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:07,902 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:18:07,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 34 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:18:07,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-10-23 20:18:07,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2024-10-23 20:18:07,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 526 states have (on average 1.3802281368821292) internal successors, (726), 526 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 726 transitions. [2024-10-23 20:18:07,933 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 726 transitions. Word has length 100 [2024-10-23 20:18:07,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:18:07,934 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 726 transitions. [2024-10-23 20:18:07,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:07,934 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 726 transitions. [2024-10-23 20:18:07,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-23 20:18:07,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:18:07,937 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-23 20:18:07,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-23 20:18:07,938 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:18:07,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:18:07,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2089046117, now seen corresponding path program 1 times [2024-10-23 20:18:07,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:18:07,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36663066] [2024-10-23 20:18:07,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:07,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:18:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:08,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:18:08,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:18:08,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36663066] [2024-10-23 20:18:08,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36663066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:18:08,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:18:08,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:18:08,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975300600] [2024-10-23 20:18:08,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:18:08,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:18:08,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:18:08,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:18:08,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:08,138 INFO L87 Difference]: Start difference. First operand 527 states and 726 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:08,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:18:08,531 INFO L93 Difference]: Finished difference Result 1446 states and 1990 transitions. [2024-10-23 20:18:08,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:18:08,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-10-23 20:18:08,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:18:08,536 INFO L225 Difference]: With dead ends: 1446 [2024-10-23 20:18:08,536 INFO L226 Difference]: Without dead ends: 920 [2024-10-23 20:18:08,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:08,539 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 39 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:18:08,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 208 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:18:08,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-10-23 20:18:08,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 658. [2024-10-23 20:18:08,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 657 states have (on average 1.3409436834094368) internal successors, (881), 657 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:08,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 881 transitions. [2024-10-23 20:18:08,567 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 881 transitions. Word has length 101 [2024-10-23 20:18:08,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:18:08,567 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 881 transitions. [2024-10-23 20:18:08,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:08,568 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 881 transitions. [2024-10-23 20:18:08,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-23 20:18:08,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:18:08,571 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-23 20:18:08,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-23 20:18:08,571 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:18:08,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:18:08,572 INFO L85 PathProgramCache]: Analyzing trace with hash 792324426, now seen corresponding path program 1 times [2024-10-23 20:18:08,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:18:08,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36434602] [2024-10-23 20:18:08,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:08,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:18:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:08,789 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:18:08,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:18:08,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36434602] [2024-10-23 20:18:08,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36434602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:18:08,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:18:08,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:18:08,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254423135] [2024-10-23 20:18:08,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:18:08,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:18:08,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:18:08,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:18:08,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:08,801 INFO L87 Difference]: Start difference. First operand 658 states and 881 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:09,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:18:09,165 INFO L93 Difference]: Finished difference Result 1970 states and 2640 transitions. [2024-10-23 20:18:09,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:18:09,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-10-23 20:18:09,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:18:09,169 INFO L225 Difference]: With dead ends: 1970 [2024-10-23 20:18:09,170 INFO L226 Difference]: Without dead ends: 1182 [2024-10-23 20:18:09,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:09,173 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 135 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 20:18:09,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 52 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 20:18:09,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2024-10-23 20:18:09,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1182. [2024-10-23 20:18:09,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 1.174428450465707) internal successors, (1387), 1181 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1387 transitions. [2024-10-23 20:18:09,206 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1387 transitions. Word has length 107 [2024-10-23 20:18:09,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:18:09,207 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1387 transitions. [2024-10-23 20:18:09,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:09,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1387 transitions. [2024-10-23 20:18:09,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-23 20:18:09,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:18:09,210 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:18:09,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-23 20:18:09,211 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:18:09,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:18:09,212 INFO L85 PathProgramCache]: Analyzing trace with hash 99155104, now seen corresponding path program 1 times [2024-10-23 20:18:09,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:18:09,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592208733] [2024-10-23 20:18:09,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:09,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:18:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:09,362 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-23 20:18:09,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:18:09,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592208733] [2024-10-23 20:18:09,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592208733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:18:09,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:18:09,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:18:09,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219277777] [2024-10-23 20:18:09,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:18:09,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:18:09,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:18:09,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:18:09,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:09,367 INFO L87 Difference]: Start difference. First operand 1182 states and 1387 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:09,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:18:09,734 INFO L93 Difference]: Finished difference Result 2756 states and 3261 transitions. [2024-10-23 20:18:09,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:18:09,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 120 [2024-10-23 20:18:09,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:18:09,742 INFO L225 Difference]: With dead ends: 2756 [2024-10-23 20:18:09,742 INFO L226 Difference]: Without dead ends: 1706 [2024-10-23 20:18:09,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:09,745 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 129 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 20:18:09,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 37 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 20:18:09,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2024-10-23 20:18:09,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1444. [2024-10-23 20:18:09,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1443 states have (on average 1.1753291753291752) internal successors, (1696), 1443 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:09,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 1696 transitions. [2024-10-23 20:18:09,776 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 1696 transitions. Word has length 120 [2024-10-23 20:18:09,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:18:09,776 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 1696 transitions. [2024-10-23 20:18:09,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:09,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 1696 transitions. [2024-10-23 20:18:09,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-23 20:18:09,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:18:09,779 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-23 20:18:09,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-23 20:18:09,783 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:18:09,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:18:09,783 INFO L85 PathProgramCache]: Analyzing trace with hash 50964105, now seen corresponding path program 1 times [2024-10-23 20:18:09,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:18:09,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849594122] [2024-10-23 20:18:09,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:09,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:18:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:09,999 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-23 20:18:09,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:18:09,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849594122] [2024-10-23 20:18:09,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849594122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:18:09,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:18:09,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:18:10,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201236482] [2024-10-23 20:18:10,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:18:10,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:18:10,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:18:10,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:18:10,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:10,001 INFO L87 Difference]: Start difference. First operand 1444 states and 1696 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:10,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:18:10,363 INFO L93 Difference]: Finished difference Result 2887 states and 3406 transitions. [2024-10-23 20:18:10,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:18:10,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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 122 [2024-10-23 20:18:10,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:18:10,370 INFO L225 Difference]: With dead ends: 2887 [2024-10-23 20:18:10,370 INFO L226 Difference]: Without dead ends: 1575 [2024-10-23 20:18:10,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:10,372 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 119 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 20:18:10,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 52 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 20:18:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2024-10-23 20:18:10,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1575. [2024-10-23 20:18:10,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1574 states have (on average 1.1658195679796697) internal successors, (1835), 1574 states have internal predecessors, (1835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:10,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 1835 transitions. [2024-10-23 20:18:10,406 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 1835 transitions. Word has length 122 [2024-10-23 20:18:10,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:18:10,406 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 1835 transitions. [2024-10-23 20:18:10,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 1835 transitions. [2024-10-23 20:18:10,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-23 20:18:10,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:18:10,409 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:18:10,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-23 20:18:10,410 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:18:10,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:18:10,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1755757905, now seen corresponding path program 1 times [2024-10-23 20:18:10,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:18:10,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347495828] [2024-10-23 20:18:10,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:10,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:18:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:10,674 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-23 20:18:10,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:18:10,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347495828] [2024-10-23 20:18:10,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347495828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:18:10,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:18:10,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-23 20:18:10,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721462556] [2024-10-23 20:18:10,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:18:10,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-23 20:18:10,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:18:10,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-23 20:18:10,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 20:18:10,678 INFO L87 Difference]: Start difference. First operand 1575 states and 1835 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:18:11,221 INFO L93 Difference]: Finished difference Result 3280 states and 3835 transitions. [2024-10-23 20:18:11,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-23 20:18:11,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2024-10-23 20:18:11,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:18:11,228 INFO L225 Difference]: With dead ends: 3280 [2024-10-23 20:18:11,228 INFO L226 Difference]: Without dead ends: 1837 [2024-10-23 20:18:11,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-23 20:18:11,231 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 370 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-23 20:18:11,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 52 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-23 20:18:11,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2024-10-23 20:18:11,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1706. [2024-10-23 20:18:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1705 states have (on average 1.1548387096774193) internal successors, (1969), 1705 states have internal predecessors, (1969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:11,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 1969 transitions. [2024-10-23 20:18:11,260 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 1969 transitions. Word has length 126 [2024-10-23 20:18:11,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:18:11,261 INFO L471 AbstractCegarLoop]: Abstraction has 1706 states and 1969 transitions. [2024-10-23 20:18:11,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:11,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 1969 transitions. [2024-10-23 20:18:11,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-23 20:18:11,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:18:11,264 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:18:11,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-23 20:18:11,264 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:18:11,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:18:11,265 INFO L85 PathProgramCache]: Analyzing trace with hash 421507858, now seen corresponding path program 1 times [2024-10-23 20:18:11,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:18:11,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948534405] [2024-10-23 20:18:11,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:11,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:18:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:18:11,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:18:11,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948534405] [2024-10-23 20:18:11,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948534405] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:18:11,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149231014] [2024-10-23 20:18:11,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:11,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:18:11,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:18:11,539 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 20:18:11,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-23 20:18:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:11,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 20:18:11,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:18:11,798 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-23 20:18:11,802 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:18:11,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149231014] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:18:11,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:18:11,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-23 20:18:11,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698181308] [2024-10-23 20:18:11,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:18:11,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:18:11,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:18:11,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:18:11,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:18:11,804 INFO L87 Difference]: Start difference. First operand 1706 states and 1969 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:12,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:18:12,192 INFO L93 Difference]: Finished difference Result 3804 states and 4469 transitions. [2024-10-23 20:18:12,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:18:12,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2024-10-23 20:18:12,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:18:12,201 INFO L225 Difference]: With dead ends: 3804 [2024-10-23 20:18:12,201 INFO L226 Difference]: Without dead ends: 2099 [2024-10-23 20:18:12,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:18:12,204 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 39 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:18:12,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 186 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:18:12,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2024-10-23 20:18:12,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1575. [2024-10-23 20:18:12,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1574 states have (on average 1.1601016518424396) internal successors, (1826), 1574 states have internal predecessors, (1826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:12,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 1826 transitions. [2024-10-23 20:18:12,259 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 1826 transitions. Word has length 144 [2024-10-23 20:18:12,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:18:12,260 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 1826 transitions. [2024-10-23 20:18:12,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:12,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 1826 transitions. [2024-10-23 20:18:12,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-23 20:18:12,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:18:12,264 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:18:12,285 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-10-23 20:18:12,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:18:12,469 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:18:12,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:18:12,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1582413146, now seen corresponding path program 1 times [2024-10-23 20:18:12,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:18:12,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933990720] [2024-10-23 20:18:12,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:12,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:18:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:12,596 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-23 20:18:12,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:18:12,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933990720] [2024-10-23 20:18:12,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933990720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:18:12,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-23 20:18:12,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-23 20:18:12,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811072745] [2024-10-23 20:18:12,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:18:12,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:18:12,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:18:12,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:18:12,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:12,598 INFO L87 Difference]: Start difference. First operand 1575 states and 1826 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:12,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:18:12,938 INFO L93 Difference]: Finished difference Result 3018 states and 3517 transitions. [2024-10-23 20:18:12,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:18:12,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2024-10-23 20:18:12,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:18:12,943 INFO L225 Difference]: With dead ends: 3018 [2024-10-23 20:18:12,943 INFO L226 Difference]: Without dead ends: 1575 [2024-10-23 20:18:12,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-23 20:18:12,945 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 117 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 20:18:12,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 25 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 20:18:12,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2024-10-23 20:18:12,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1575. [2024-10-23 20:18:12,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1574 states have (on average 1.1092757306226175) internal successors, (1746), 1574 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:12,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 1746 transitions. [2024-10-23 20:18:12,972 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 1746 transitions. Word has length 152 [2024-10-23 20:18:12,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:18:12,973 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 1746 transitions. [2024-10-23 20:18:12,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:12,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 1746 transitions. [2024-10-23 20:18:12,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-23 20:18:12,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:18:12,976 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-23 20:18:12,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-23 20:18:12,977 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:18:12,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:18:12,978 INFO L85 PathProgramCache]: Analyzing trace with hash 380116189, now seen corresponding path program 1 times [2024-10-23 20:18:12,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:18:12,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110711205] [2024-10-23 20:18:12,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:12,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:18:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:13,150 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-23 20:18:13,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:18:13,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110711205] [2024-10-23 20:18:13,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110711205] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:18:13,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86352601] [2024-10-23 20:18:13,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:13,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:18:13,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:18:13,153 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 20:18:13,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-23 20:18:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:13,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 20:18:13,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:18:13,430 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-23 20:18:13,431 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:18:13,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86352601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:18:13,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:18:13,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-23 20:18:13,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728649478] [2024-10-23 20:18:13,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:18:13,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:18:13,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:18:13,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:18:13,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:18:13,434 INFO L87 Difference]: Start difference. First operand 1575 states and 1746 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:13,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:18:13,799 INFO L93 Difference]: Finished difference Result 4197 states and 4680 transitions. [2024-10-23 20:18:13,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:18:13,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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-10-23 20:18:13,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:18:13,807 INFO L225 Difference]: With dead ends: 4197 [2024-10-23 20:18:13,807 INFO L226 Difference]: Without dead ends: 2754 [2024-10-23 20:18:13,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:18:13,810 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 60 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 20:18:13,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 27 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 20:18:13,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2754 states. [2024-10-23 20:18:13,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 2754. [2024-10-23 20:18:13,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2754 states, 2753 states have (on average 1.1078823102070467) internal successors, (3050), 2753 states have internal predecessors, (3050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:13,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2754 states to 2754 states and 3050 transitions. [2024-10-23 20:18:13,872 INFO L78 Accepts]: Start accepts. Automaton has 2754 states and 3050 transitions. Word has length 153 [2024-10-23 20:18:13,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:18:13,873 INFO L471 AbstractCegarLoop]: Abstraction has 2754 states and 3050 transitions. [2024-10-23 20:18:13,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:13,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2754 states and 3050 transitions. [2024-10-23 20:18:13,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-23 20:18:13,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:18:13,878 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:18:13,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-23 20:18:14,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-23 20:18:14,080 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:18:14,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:18:14,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1314325983, now seen corresponding path program 1 times [2024-10-23 20:18:14,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:18:14,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715104337] [2024-10-23 20:18:14,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:14,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:18:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 78 proven. 10 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-23 20:18:14,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:18:14,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715104337] [2024-10-23 20:18:14,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715104337] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:18:14,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466388832] [2024-10-23 20:18:14,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:14,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:18:14,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:18:14,329 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 20:18:14,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-23 20:18:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:14,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 20:18:14,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:18:14,547 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-10-23 20:18:14,550 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:18:14,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466388832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:18:14,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:18:14,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-23 20:18:14,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020994343] [2024-10-23 20:18:14,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:18:14,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:18:14,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:18:14,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:18:14,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:18:14,552 INFO L87 Difference]: Start difference. First operand 2754 states and 3050 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:14,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:18:14,942 INFO L93 Difference]: Finished difference Result 5507 states and 6117 transitions. [2024-10-23 20:18:14,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:18:14,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 163 [2024-10-23 20:18:14,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:18:14,952 INFO L225 Difference]: With dead ends: 5507 [2024-10-23 20:18:14,952 INFO L226 Difference]: Without dead ends: 2885 [2024-10-23 20:18:14,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:18:14,956 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 43 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-23 20:18:14,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 160 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-23 20:18:14,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2885 states. [2024-10-23 20:18:14,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2885 to 2623. [2024-10-23 20:18:14,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2623 states, 2622 states have (on average 1.0865751334858886) internal successors, (2849), 2622 states have internal predecessors, (2849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2623 states to 2623 states and 2849 transitions. [2024-10-23 20:18:14,993 INFO L78 Accepts]: Start accepts. Automaton has 2623 states and 2849 transitions. Word has length 163 [2024-10-23 20:18:14,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:18:14,993 INFO L471 AbstractCegarLoop]: Abstraction has 2623 states and 2849 transitions. [2024-10-23 20:18:14,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:14,994 INFO L276 IsEmpty]: Start isEmpty. Operand 2623 states and 2849 transitions. [2024-10-23 20:18:14,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-23 20:18:14,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-23 20:18:14,998 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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-10-23 20:18:15,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-23 20:18:15,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:18:15,199 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-23 20:18:15,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-23 20:18:15,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1581851640, now seen corresponding path program 1 times [2024-10-23 20:18:15,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-23 20:18:15,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835585272] [2024-10-23 20:18:15,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:15,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-23 20:18:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 105 proven. 10 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-23 20:18:15,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-23 20:18:15,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835585272] [2024-10-23 20:18:15,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835585272] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-23 20:18:15,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085374546] [2024-10-23 20:18:15,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-23 20:18:15,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:18:15,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-23 20:18:15,446 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-23 20:18:15,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-23 20:18:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-23 20:18:15,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-23 20:18:15,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-23 20:18:15,705 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-23 20:18:15,707 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-23 20:18:15,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085374546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-23 20:18:15,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-23 20:18:15,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-23 20:18:15,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738798122] [2024-10-23 20:18:15,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-23 20:18:15,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-23 20:18:15,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-23 20:18:15,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-23 20:18:15,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:18:15,711 INFO L87 Difference]: Start difference. First operand 2623 states and 2849 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:16,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-23 20:18:16,030 INFO L93 Difference]: Finished difference Result 5112 states and 5565 transitions. [2024-10-23 20:18:16,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-23 20:18:16,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 180 [2024-10-23 20:18:16,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-23 20:18:16,032 INFO L225 Difference]: With dead ends: 5112 [2024-10-23 20:18:16,032 INFO L226 Difference]: Without dead ends: 0 [2024-10-23 20:18:16,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-23 20:18:16,036 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 50 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-23 20:18:16,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 167 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-23 20:18:16,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-23 20:18:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-23 20:18:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-23 20:18:16,038 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 180 [2024-10-23 20:18:16,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-23 20:18:16,038 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-23 20:18:16,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-23 20:18:16,039 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-23 20:18:16,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-23 20:18:16,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-23 20:18:16,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-23 20:18:16,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-23 20:18:16,246 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-23 20:18:16,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-23 20:18:16,651 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-23 20:18:16,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 08:18:16 BoogieIcfgContainer [2024-10-23 20:18:16,672 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-23 20:18:16,673 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-23 20:18:16,673 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-23 20:18:16,673 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-23 20:18:16,673 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 08:18:05" (3/4) ... [2024-10-23 20:18:16,675 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-23 20:18:16,692 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-23 20:18:16,693 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-23 20:18:16,694 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-23 20:18:16,694 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-23 20:18:16,852 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-23 20:18:16,853 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-23 20:18:16,853 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-23 20:18:16,853 INFO L158 Benchmark]: Toolchain (without parser) took 13041.95ms. Allocated memory was 144.7MB in the beginning and 306.2MB in the end (delta: 161.5MB). Free memory was 89.2MB in the beginning and 114.0MB in the end (delta: -24.8MB). Peak memory consumption was 138.2MB. Max. memory is 16.1GB. [2024-10-23 20:18:16,853 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 144.7MB. Free memory was 104.4MB in the beginning and 104.2MB in the end (delta: 169.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-23 20:18:16,854 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.57ms. Allocated memory is still 144.7MB. Free memory was 89.2MB in the beginning and 113.5MB in the end (delta: -24.3MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2024-10-23 20:18:16,854 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.24ms. Allocated memory was 144.7MB in the beginning and 195.0MB in the end (delta: 50.3MB). Free memory was 113.5MB in the beginning and 160.3MB in the end (delta: -46.9MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-10-23 20:18:16,854 INFO L158 Benchmark]: Boogie Preprocessor took 123.34ms. Allocated memory is still 195.0MB. Free memory was 160.3MB in the beginning and 155.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-23 20:18:16,854 INFO L158 Benchmark]: RCFGBuilder took 1077.89ms. Allocated memory is still 195.0MB. Free memory was 155.1MB in the beginning and 64.9MB in the end (delta: 90.2MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. [2024-10-23 20:18:16,855 INFO L158 Benchmark]: TraceAbstraction took 10961.24ms. Allocated memory was 195.0MB in the beginning and 306.2MB in the end (delta: 111.1MB). Free memory was 63.9MB in the beginning and 126.6MB in the end (delta: -62.7MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2024-10-23 20:18:16,855 INFO L158 Benchmark]: Witness Printer took 179.95ms. Allocated memory is still 306.2MB. Free memory was 126.6MB in the beginning and 114.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-23 20:18:16,859 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 144.7MB. Free memory was 104.4MB in the beginning and 104.2MB in the end (delta: 169.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 586.57ms. Allocated memory is still 144.7MB. Free memory was 89.2MB in the beginning and 113.5MB in the end (delta: -24.3MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.24ms. Allocated memory was 144.7MB in the beginning and 195.0MB in the end (delta: 50.3MB). Free memory was 113.5MB in the beginning and 160.3MB in the end (delta: -46.9MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 123.34ms. Allocated memory is still 195.0MB. Free memory was 160.3MB in the beginning and 155.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1077.89ms. Allocated memory is still 195.0MB. Free memory was 155.1MB in the beginning and 64.9MB in the end (delta: 90.2MB). Peak memory consumption was 90.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10961.24ms. Allocated memory was 195.0MB in the beginning and 306.2MB in the end (delta: 111.1MB). Free memory was 63.9MB in the beginning and 126.6MB in the end (delta: -62.7MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. * Witness Printer took 179.95ms. Allocated memory is still 306.2MB. Free memory was 126.6MB in the beginning and 114.0MB 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: 471]: 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, 136 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1293 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1293 mSDsluCounter, 1223 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 528 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3981 IncrementalHoareTripleChecker+Invalid, 4509 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 528 mSolverCounterUnsat, 1165 mSDtfsCounter, 3981 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 669 GetRequests, 648 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2754occurred in iteration=11, 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.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 1441 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2296 NumberOfCodeBlocks, 2296 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2279 ConstructedInterpolants, 0 QuantifiedInterpolants, 5235 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1219 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 933/1023 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: 593]: Loop Invariant Derived loop invariant: ((((((((((((((a20 <= 0) && (a21 == 1)) && (a17 == 1)) && (a16 <= 5)) || (((a8 <= 13) && (a21 == 1)) && (a17 == 1))) || (((a20 <= 0) && (a17 <= 0)) && (15 <= a8))) || (((((a7 <= 0) && (5 == a16)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1))) || (((a8 <= 13) && (a17 == 1)) && (a20 == 1))) || (((5 <= a16) && (a17 <= 0)) && (a20 == 1))) || (((a8 < 14) || ((14 == a8) && (a16 <= 5))) && (a17 <= 0))) || (((a7 <= 0) && (a17 <= 0)) && (a20 == 1))) || ((a20 <= 0) && ((a8 < 14) || ((14 == a8) && (a16 <= 5))))) || (((((a8 <= 14) && (a21 == 1)) && (a17 == 1)) && (a16 <= 5)) && (a20 == 1))) || (((((a7 <= 0) && (a20 <= 0)) && (a21 == 1)) && (a17 == 1)) && (15 <= a8))) RESULT: Ultimate proved your program to be correct! [2024-10-23 20:18:16,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE