./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label24.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label24.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 2a6634174770c2d78435b26741915661650ffd8b51b8148a319e19b0e5237d4f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:53:52,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:53:52,662 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:53:52,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:53:52,666 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:53:52,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:53:52,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:53:52,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:53:52,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:53:52,693 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:53:52,693 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:53:52,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:53:52,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:53:52,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:53:52,694 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:53:52,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:53:52,695 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:53:52,695 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:53:52,695 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:53:52,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:53:52,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:53:52,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:53:52,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:53:52,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:53:52,695 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:53:52,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:53:52,695 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:53:52,695 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:53:52,696 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:53:52,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:53:52,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:53:52,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:53:52,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:53:52,696 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:53:52,696 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:53:52,696 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:53:52,696 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:53:52,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:53:52,697 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:53:52,697 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:53:52,697 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:53:52,697 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:53:52,697 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:53:52,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:53:52,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:53:52,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:53:52,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:53:52,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:53:52,698 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 2a6634174770c2d78435b26741915661650ffd8b51b8148a319e19b0e5237d4f [2025-01-08 22:53:52,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:53:52,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:53:52,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:53:52,956 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:53:52,956 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:53:52,957 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label24.c [2025-01-08 22:53:54,091 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff6f22be7/b278cf51e10a427ca314f106bc5844bb/FLAG6ef730bfa [2025-01-08 22:53:54,387 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:53:54,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label24.c [2025-01-08 22:53:54,398 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff6f22be7/b278cf51e10a427ca314f106bc5844bb/FLAG6ef730bfa [2025-01-08 22:53:54,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ff6f22be7/b278cf51e10a427ca314f106bc5844bb [2025-01-08 22:53:54,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:53:54,662 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:53:54,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:53:54,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:53:54,666 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:53:54,667 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:53:54" (1/1) ... [2025-01-08 22:53:54,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb92a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:54, skipping insertion in model container [2025-01-08 22:53:54,668 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:53:54" (1/1) ... [2025-01-08 22:53:54,694 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:53:54,923 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label24.c[18375,18388] [2025-01-08 22:53:54,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:53:54,952 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:53:55,006 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label24.c[18375,18388] [2025-01-08 22:53:55,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:53:55,026 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:53:55,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:55 WrapperNode [2025-01-08 22:53:55,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:53:55,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:53:55,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:53:55,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:53:55,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:55" (1/1) ... [2025-01-08 22:53:55,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:55" (1/1) ... [2025-01-08 22:53:55,076 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 666 [2025-01-08 22:53:55,077 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:53:55,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:53:55,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:53:55,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:53:55,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:55" (1/1) ... [2025-01-08 22:53:55,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:55" (1/1) ... [2025-01-08 22:53:55,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:55" (1/1) ... [2025-01-08 22:53:55,110 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]. [2025-01-08 22:53:55,113 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:55" (1/1) ... [2025-01-08 22:53:55,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:55" (1/1) ... [2025-01-08 22:53:55,128 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:55" (1/1) ... [2025-01-08 22:53:55,130 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:55" (1/1) ... [2025-01-08 22:53:55,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:55" (1/1) ... [2025-01-08 22:53:55,138 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:55" (1/1) ... [2025-01-08 22:53:55,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:55" (1/1) ... [2025-01-08 22:53:55,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:53:55,144 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:53:55,144 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:53:55,144 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:53:55,145 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:55" (1/1) ... [2025-01-08 22:53:55,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:53:55,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:53:55,170 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:53:55,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 22:53:55,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:53:55,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:53:55,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:53:55,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:53:55,244 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:53:55,245 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:53:56,050 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-01-08 22:53:56,050 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:53:56,063 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:53:56,064 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:53:56,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:53:56 BoogieIcfgContainer [2025-01-08 22:53:56,064 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:53:56,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:53:56,068 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:53:56,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:53:56,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:53:54" (1/3) ... [2025-01-08 22:53:56,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3e4e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:53:56, skipping insertion in model container [2025-01-08 22:53:56,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:55" (2/3) ... [2025-01-08 22:53:56,071 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e3e4e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:53:56, skipping insertion in model container [2025-01-08 22:53:56,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:53:56" (3/3) ... [2025-01-08 22:53:56,073 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem02_label24.c [2025-01-08 22:53:56,083 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:53:56,085 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label24.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:53:56,136 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:53:56,146 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;@26a15635, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:53:56,146 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:53:56,150 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 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) [2025-01-08 22:53:56,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-08 22:53:56,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:56,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:56,160 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:56,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:56,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1157064883, now seen corresponding path program 1 times [2025-01-08 22:53:56,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:56,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624083582] [2025-01-08 22:53:56,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:56,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:56,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-08 22:53:56,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-08 22:53:56,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:56,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:56,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:53:56,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:56,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624083582] [2025-01-08 22:53:56,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624083582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:56,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:56,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:53:56,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359098279] [2025-01-08 22:53:56,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:56,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:56,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:56,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:56,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:56,638 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:57,263 INFO L93 Difference]: Finished difference Result 600 states and 1034 transitions. [2025-01-08 22:53:57,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:57,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-01-08 22:53:57,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:57,270 INFO L225 Difference]: With dead ends: 600 [2025-01-08 22:53:57,270 INFO L226 Difference]: Without dead ends: 309 [2025-01-08 22:53:57,273 INFO L434 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 [2025-01-08 22:53:57,275 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 52 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:57,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 171 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:53:57,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-01-08 22:53:57,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2025-01-08 22:53:57,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.3300653594771241) internal successors, (407), 306 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:57,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 407 transitions. [2025-01-08 22:53:57,305 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 407 transitions. Word has length 114 [2025-01-08 22:53:57,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:57,306 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 407 transitions. [2025-01-08 22:53:57,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:57,307 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 407 transitions. [2025-01-08 22:53:57,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-08 22:53:57,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:57,310 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:57,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:53:57,310 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:57,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:57,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1930515245, now seen corresponding path program 1 times [2025-01-08 22:53:57,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:57,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583497455] [2025-01-08 22:53:57,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:57,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:57,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-08 22:53:57,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-08 22:53:57,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:57,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:57,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:53:57,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:57,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583497455] [2025-01-08 22:53:57,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583497455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:57,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:57,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:53:57,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239400037] [2025-01-08 22:53:57,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:57,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:57,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:57,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:57,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:57,518 INFO L87 Difference]: Start difference. First operand 307 states and 407 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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) [2025-01-08 22:53:57,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:57,890 INFO L93 Difference]: Finished difference Result 758 states and 1034 transitions. [2025-01-08 22:53:57,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:57,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 119 [2025-01-08 22:53:57,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:57,894 INFO L225 Difference]: With dead ends: 758 [2025-01-08 22:53:57,894 INFO L226 Difference]: Without dead ends: 453 [2025-01-08 22:53:57,895 INFO L434 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 [2025-01-08 22:53:57,897 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 50 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:57,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 248 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:53:57,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-01-08 22:53:57,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 453. [2025-01-08 22:53:57,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.2787610619469028) internal successors, (578), 452 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:57,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 578 transitions. [2025-01-08 22:53:57,917 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 578 transitions. Word has length 119 [2025-01-08 22:53:57,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:57,917 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 578 transitions. [2025-01-08 22:53:57,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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) [2025-01-08 22:53:57,917 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 578 transitions. [2025-01-08 22:53:57,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-08 22:53:57,919 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:57,919 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:57,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:53:57,920 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:57,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:57,920 INFO L85 PathProgramCache]: Analyzing trace with hash -525974504, now seen corresponding path program 1 times [2025-01-08 22:53:57,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:57,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415291655] [2025-01-08 22:53:57,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:57,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:57,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-08 22:53:57,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-08 22:53:57,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:57,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:53:58,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:58,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415291655] [2025-01-08 22:53:58,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415291655] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:58,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:58,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:53:58,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110476486] [2025-01-08 22:53:58,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:58,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:58,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:58,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:58,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:58,005 INFO L87 Difference]: Start difference. First operand 453 states and 578 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 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) [2025-01-08 22:53:58,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:58,367 INFO L93 Difference]: Finished difference Result 1325 states and 1691 transitions. [2025-01-08 22:53:58,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:58,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 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 131 [2025-01-08 22:53:58,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:58,371 INFO L225 Difference]: With dead ends: 1325 [2025-01-08 22:53:58,371 INFO L226 Difference]: Without dead ends: 874 [2025-01-08 22:53:58,371 INFO L434 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 [2025-01-08 22:53:58,372 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 185 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:58,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 80 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:53:58,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-01-08 22:53:58,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2025-01-08 22:53:58,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 873 states have (on average 1.2302405498281788) internal successors, (1074), 873 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:58,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1074 transitions. [2025-01-08 22:53:58,395 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1074 transitions. Word has length 131 [2025-01-08 22:53:58,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:58,395 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1074 transitions. [2025-01-08 22:53:58,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 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) [2025-01-08 22:53:58,396 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1074 transitions. [2025-01-08 22:53:58,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-08 22:53:58,397 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:58,398 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:58,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:53:58,398 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:58,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:58,398 INFO L85 PathProgramCache]: Analyzing trace with hash -2054895280, now seen corresponding path program 1 times [2025-01-08 22:53:58,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:58,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044423390] [2025-01-08 22:53:58,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:58,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:58,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-08 22:53:58,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-08 22:53:58,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:58,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:53:58,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:58,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044423390] [2025-01-08 22:53:58,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044423390] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:58,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:58,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:53:58,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120375477] [2025-01-08 22:53:58,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:58,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:58,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:58,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:58,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:58,531 INFO L87 Difference]: Start difference. First operand 874 states and 1074 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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) [2025-01-08 22:53:58,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:58,897 INFO L93 Difference]: Finished difference Result 2594 states and 3192 transitions. [2025-01-08 22:53:58,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:58,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 [2025-01-08 22:53:58,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:58,903 INFO L225 Difference]: With dead ends: 2594 [2025-01-08 22:53:58,904 INFO L226 Difference]: Without dead ends: 1722 [2025-01-08 22:53:58,905 INFO L434 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 [2025-01-08 22:53:58,906 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 49 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:58,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 291 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:53:58,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2025-01-08 22:53:58,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1716. [2025-01-08 22:53:58,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1715 states have (on average 1.1900874635568512) internal successors, (2041), 1715 states have internal predecessors, (2041), 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) [2025-01-08 22:53:58,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2041 transitions. [2025-01-08 22:53:58,934 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2041 transitions. Word has length 144 [2025-01-08 22:53:58,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:58,936 INFO L471 AbstractCegarLoop]: Abstraction has 1716 states and 2041 transitions. [2025-01-08 22:53:58,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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) [2025-01-08 22:53:58,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2041 transitions. [2025-01-08 22:53:58,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-08 22:53:58,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:58,938 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:58,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:53:58,938 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:58,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:58,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1782100096, now seen corresponding path program 1 times [2025-01-08 22:53:58,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:58,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706355288] [2025-01-08 22:53:58,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:58,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:58,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-08 22:53:58,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-08 22:53:58,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:58,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:59,149 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:53:59,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:59,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706355288] [2025-01-08 22:53:59,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706355288] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:59,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:59,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:53:59,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090198384] [2025-01-08 22:53:59,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:59,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:53:59,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:59,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:53:59,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:53:59,150 INFO L87 Difference]: Start difference. First operand 1716 states and 2041 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 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) [2025-01-08 22:53:59,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:59,814 INFO L93 Difference]: Finished difference Result 4410 states and 5196 transitions. [2025-01-08 22:53:59,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:53:59,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 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 160 [2025-01-08 22:53:59,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:59,820 INFO L225 Difference]: With dead ends: 4410 [2025-01-08 22:53:59,820 INFO L226 Difference]: Without dead ends: 2276 [2025-01-08 22:53:59,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:53:59,822 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 348 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:59,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 162 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:53:59,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2025-01-08 22:53:59,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 1996. [2025-01-08 22:53:59,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1996 states, 1995 states have (on average 1.1333333333333333) internal successors, (2261), 1995 states have internal predecessors, (2261), 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) [2025-01-08 22:53:59,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 2261 transitions. [2025-01-08 22:53:59,849 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 2261 transitions. Word has length 160 [2025-01-08 22:53:59,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:59,849 INFO L471 AbstractCegarLoop]: Abstraction has 1996 states and 2261 transitions. [2025-01-08 22:53:59,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 4 states have internal predecessors, (146), 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) [2025-01-08 22:53:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2261 transitions. [2025-01-08 22:53:59,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-08 22:53:59,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:59,852 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:59,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:53:59,852 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:59,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:59,853 INFO L85 PathProgramCache]: Analyzing trace with hash -191497975, now seen corresponding path program 1 times [2025-01-08 22:53:59,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:59,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293985809] [2025-01-08 22:53:59,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:59,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:59,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-08 22:53:59,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-08 22:53:59,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:59,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-08 22:53:59,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:59,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293985809] [2025-01-08 22:53:59,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293985809] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:59,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:59,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:53:59,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531650679] [2025-01-08 22:53:59,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:59,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:59,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:59,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:59,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:59,974 INFO L87 Difference]: Start difference. First operand 1996 states and 2261 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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) [2025-01-08 22:54:00,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:00,296 INFO L93 Difference]: Finished difference Result 4559 states and 5180 transitions. [2025-01-08 22:54:00,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:00,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 182 [2025-01-08 22:54:00,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:00,302 INFO L225 Difference]: With dead ends: 4559 [2025-01-08 22:54:00,303 INFO L226 Difference]: Without dead ends: 2565 [2025-01-08 22:54:00,305 INFO L434 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 [2025-01-08 22:54:00,305 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 133 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:00,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 223 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:54:00,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2025-01-08 22:54:00,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 2276. [2025-01-08 22:54:00,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2276 states, 2275 states have (on average 1.1331868131868132) internal successors, (2578), 2275 states have internal predecessors, (2578), 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) [2025-01-08 22:54:00,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2276 states to 2276 states and 2578 transitions. [2025-01-08 22:54:00,338 INFO L78 Accepts]: Start accepts. Automaton has 2276 states and 2578 transitions. Word has length 182 [2025-01-08 22:54:00,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:00,338 INFO L471 AbstractCegarLoop]: Abstraction has 2276 states and 2578 transitions. [2025-01-08 22:54:00,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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) [2025-01-08 22:54:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2276 states and 2578 transitions. [2025-01-08 22:54:00,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-08 22:54:00,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:00,342 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:00,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:54:00,342 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:00,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:00,342 INFO L85 PathProgramCache]: Analyzing trace with hash -696853424, now seen corresponding path program 1 times [2025-01-08 22:54:00,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:00,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965394819] [2025-01-08 22:54:00,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:00,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:00,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-08 22:54:00,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-08 22:54:00,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:00,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:54:00,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:00,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965394819] [2025-01-08 22:54:00,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965394819] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:00,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:00,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:00,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071524762] [2025-01-08 22:54:00,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:00,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:00,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:00,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:00,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:00,451 INFO L87 Difference]: Start difference. First operand 2276 states and 2578 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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) [2025-01-08 22:54:00,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:00,748 INFO L93 Difference]: Finished difference Result 4549 states and 5153 transitions. [2025-01-08 22:54:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:00,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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 202 [2025-01-08 22:54:00,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:00,754 INFO L225 Difference]: With dead ends: 4549 [2025-01-08 22:54:00,754 INFO L226 Difference]: Without dead ends: 2275 [2025-01-08 22:54:00,756 INFO L434 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 [2025-01-08 22:54:00,757 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 150 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:00,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 65 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:54:00,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2025-01-08 22:54:00,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 2274. [2025-01-08 22:54:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2274 states, 2273 states have (on average 1.108227012758469) internal successors, (2519), 2273 states have internal predecessors, (2519), 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) [2025-01-08 22:54:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 2519 transitions. [2025-01-08 22:54:00,787 INFO L78 Accepts]: Start accepts. Automaton has 2274 states and 2519 transitions. Word has length 202 [2025-01-08 22:54:00,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:00,788 INFO L471 AbstractCegarLoop]: Abstraction has 2274 states and 2519 transitions. [2025-01-08 22:54:00,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 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) [2025-01-08 22:54:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 2519 transitions. [2025-01-08 22:54:00,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-08 22:54:00,791 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:00,791 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 22:54:00,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:54:00,792 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:00,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:00,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1519430353, now seen corresponding path program 1 times [2025-01-08 22:54:00,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:00,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91838099] [2025-01-08 22:54:00,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:00,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:00,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-08 22:54:00,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-08 22:54:00,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:00,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:54:00,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:00,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91838099] [2025-01-08 22:54:00,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91838099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:00,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:00,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:00,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175219594] [2025-01-08 22:54:00,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:00,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:00,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:00,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:00,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:00,876 INFO L87 Difference]: Start difference. First operand 2274 states and 2519 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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) [2025-01-08 22:54:01,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:01,216 INFO L93 Difference]: Finished difference Result 5524 states and 6100 transitions. [2025-01-08 22:54:01,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:01,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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 203 [2025-01-08 22:54:01,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:01,224 INFO L225 Difference]: With dead ends: 5524 [2025-01-08 22:54:01,224 INFO L226 Difference]: Without dead ends: 3252 [2025-01-08 22:54:01,226 INFO L434 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 [2025-01-08 22:54:01,226 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 141 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:01,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 67 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:54:01,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3252 states. [2025-01-08 22:54:01,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3252 to 2272. [2025-01-08 22:54:01,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 2271 states have (on average 1.0937912813738442) internal successors, (2484), 2271 states have internal predecessors, (2484), 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) [2025-01-08 22:54:01,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2484 transitions. [2025-01-08 22:54:01,263 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2484 transitions. Word has length 203 [2025-01-08 22:54:01,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:01,264 INFO L471 AbstractCegarLoop]: Abstraction has 2272 states and 2484 transitions. [2025-01-08 22:54:01,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 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) [2025-01-08 22:54:01,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2484 transitions. [2025-01-08 22:54:01,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-01-08 22:54:01,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:01,269 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:01,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:54:01,269 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:01,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:01,270 INFO L85 PathProgramCache]: Analyzing trace with hash 767299455, now seen corresponding path program 1 times [2025-01-08 22:54:01,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:01,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120515197] [2025-01-08 22:54:01,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:01,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:01,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-08 22:54:01,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-08 22:54:01,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:01,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:01,373 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-08 22:54:01,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:01,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120515197] [2025-01-08 22:54:01,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120515197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:01,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:01,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:01,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721322177] [2025-01-08 22:54:01,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:01,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:01,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:01,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:01,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:01,375 INFO L87 Difference]: Start difference. First operand 2272 states and 2484 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:01,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:01,670 INFO L93 Difference]: Finished difference Result 4814 states and 5231 transitions. [2025-01-08 22:54:01,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:01,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2025-01-08 22:54:01,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:01,675 INFO L225 Difference]: With dead ends: 4814 [2025-01-08 22:54:01,675 INFO L226 Difference]: Without dead ends: 1701 [2025-01-08 22:54:01,678 INFO L434 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 [2025-01-08 22:54:01,678 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 81 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:01,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 225 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:54:01,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2025-01-08 22:54:01,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1701. [2025-01-08 22:54:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1700 states have (on average 1.0552941176470587) internal successors, (1794), 1700 states have internal predecessors, (1794), 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) [2025-01-08 22:54:01,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 1794 transitions. [2025-01-08 22:54:01,701 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 1794 transitions. Word has length 207 [2025-01-08 22:54:01,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:01,701 INFO L471 AbstractCegarLoop]: Abstraction has 1701 states and 1794 transitions. [2025-01-08 22:54:01,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:54:01,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 1794 transitions. [2025-01-08 22:54:01,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-01-08 22:54:01,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:01,704 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:01,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:54:01,704 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:01,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:01,705 INFO L85 PathProgramCache]: Analyzing trace with hash 265250467, now seen corresponding path program 1 times [2025-01-08 22:54:01,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:01,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847045159] [2025-01-08 22:54:01,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:01,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:01,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-01-08 22:54:01,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-01-08 22:54:01,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:01,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:01,814 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-08 22:54:01,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:01,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847045159] [2025-01-08 22:54:01,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847045159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:01,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:01,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:01,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427228612] [2025-01-08 22:54:01,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:01,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:01,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:01,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:01,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:01,816 INFO L87 Difference]: Start difference. First operand 1701 states and 1794 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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) [2025-01-08 22:54:02,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:02,085 INFO L93 Difference]: Finished difference Result 3541 states and 3753 transitions. [2025-01-08 22:54:02,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:02,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 242 [2025-01-08 22:54:02,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:02,090 INFO L225 Difference]: With dead ends: 3541 [2025-01-08 22:54:02,090 INFO L226 Difference]: Without dead ends: 1839 [2025-01-08 22:54:02,092 INFO L434 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 [2025-01-08 22:54:02,092 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 126 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:02,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 190 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:54:02,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2025-01-08 22:54:02,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1839. [2025-01-08 22:54:02,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1838 states have (on average 1.0462459194776932) internal successors, (1923), 1838 states have internal predecessors, (1923), 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) [2025-01-08 22:54:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 1923 transitions. [2025-01-08 22:54:02,115 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 1923 transitions. Word has length 242 [2025-01-08 22:54:02,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:02,115 INFO L471 AbstractCegarLoop]: Abstraction has 1839 states and 1923 transitions. [2025-01-08 22:54:02,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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) [2025-01-08 22:54:02,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 1923 transitions. [2025-01-08 22:54:02,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-01-08 22:54:02,118 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:54:02,118 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:02,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:54:02,118 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:54:02,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:54:02,119 INFO L85 PathProgramCache]: Analyzing trace with hash 402946197, now seen corresponding path program 1 times [2025-01-08 22:54:02,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:54:02,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483956752] [2025-01-08 22:54:02,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:54:02,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:54:02,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-01-08 22:54:02,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-01-08 22:54:02,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:54:02,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:54:02,218 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-08 22:54:02,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:54:02,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483956752] [2025-01-08 22:54:02,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483956752] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:54:02,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:54:02,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:54:02,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894321997] [2025-01-08 22:54:02,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:54:02,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:54:02,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:54:02,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:54:02,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:54:02,220 INFO L87 Difference]: Start difference. First operand 1839 states and 1923 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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) [2025-01-08 22:54:02,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:54:02,465 INFO L93 Difference]: Finished difference Result 3531 states and 3696 transitions. [2025-01-08 22:54:02,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:54:02,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 251 [2025-01-08 22:54:02,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:54:02,466 INFO L225 Difference]: With dead ends: 3531 [2025-01-08 22:54:02,466 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 22:54:02,469 INFO L434 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 [2025-01-08 22:54:02,469 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 43 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:54:02,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 181 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:54:02,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 22:54:02,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 22:54:02,470 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) [2025-01-08 22:54:02,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 22:54:02,470 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 251 [2025-01-08 22:54:02,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:54:02,470 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 22:54:02,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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) [2025-01-08 22:54:02,470 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 22:54:02,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 22:54:02,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:54:02,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 22:54:02,475 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:54:02,476 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 22:54:02,749 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:54:02,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:54:02 BoogieIcfgContainer [2025-01-08 22:54:02,758 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:54:02,759 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:54:02,759 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:54:02,759 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:54:02,759 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:53:56" (3/4) ... [2025-01-08 22:54:02,761 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 22:54:02,776 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 22:54:02,777 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 22:54:02,780 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 22:54:02,780 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 22:54:02,885 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 22:54:02,885 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 22:54:02,885 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:54:02,887 INFO L158 Benchmark]: Toolchain (without parser) took 8225.02ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 105.6MB in the beginning and 144.9MB in the end (delta: -39.3MB). Peak memory consumption was 101.4MB. Max. memory is 16.1GB. [2025-01-08 22:54:02,887 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:54:02,888 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.20ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 79.5MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 22:54:02,888 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.39ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 74.1MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:54:02,888 INFO L158 Benchmark]: Boogie Preprocessor took 66.65ms. Allocated memory is still 142.6MB. Free memory was 74.1MB in the beginning and 69.7MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:54:02,888 INFO L158 Benchmark]: RCFGBuilder took 919.78ms. Allocated memory is still 142.6MB. Free memory was 69.7MB in the beginning and 59.3MB in the end (delta: 10.4MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2025-01-08 22:54:02,888 INFO L158 Benchmark]: TraceAbstraction took 6691.09ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 58.6MB in the beginning and 156.3MB in the end (delta: -97.8MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2025-01-08 22:54:02,888 INFO L158 Benchmark]: Witness Printer took 126.32ms. Allocated memory is still 285.2MB. Free memory was 156.3MB in the beginning and 144.9MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:54:02,889 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.20ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 79.5MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.39ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 74.1MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.65ms. Allocated memory is still 142.6MB. Free memory was 74.1MB in the beginning and 69.7MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 919.78ms. Allocated memory is still 142.6MB. Free memory was 69.7MB in the beginning and 59.3MB in the end (delta: 10.4MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6691.09ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 58.6MB in the beginning and 156.3MB in the end (delta: -97.8MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. * Witness Printer took 126.32ms. Allocated memory is still 285.2MB. Free memory was 156.3MB in the beginning and 144.9MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. 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: 524]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 11, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1358 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1358 mSDsluCounter, 1903 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 224 mSDsCounter, 746 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4471 IncrementalHoareTripleChecker+Invalid, 5217 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 746 mSolverCounterUnsat, 1679 mSDtfsCounter, 4471 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2276occurred in iteration=6, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1558 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1955 NumberOfCodeBlocks, 1955 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1944 ConstructedInterpolants, 0 QuantifiedInterpolants, 3620 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 1077/1077 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: (((((((((((((((a17 == 8) && (a28 == 10)) && (a21 == 1)) && (a19 == 1)) && (a11 != 1)) || ((((a17 == 8) && (a25 == 1)) && (a21 == 1)) && (a19 == 1))) || ((a19 != 1) && (a28 <= 7))) || (((10 <= a28) && (a17 <= 7)) && (a19 == 1))) || (((a28 <= 9) && (a19 != 1)) && (a11 != 1))) || ((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || ((a25 == 1) && (a11 != 1))) || ((((a17 == 8) && (a21 == 1)) && (a11 != 1)) && (a28 <= 7))) || ((10 <= a28) && (a25 == a19))) || ((a25 == 1) && (a28 <= 7))) || (((a25 == 1) && (a28 <= 9)) && (a17 <= 7))) RESULT: Ultimate proved your program to be correct! [2025-01-08 22:54:02,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE