./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label43.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label43.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 009b18d49acf284b9866fb4283bf61c04b940d5d5b8f73fcface32bff3af3727 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:38:31,070 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:38:31,128 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:38:31,134 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:38:31,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:38:31,157 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:38:31,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:38:31,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:38:31,159 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:38:31,160 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:38:31,160 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:38:31,160 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:38:31,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:38:31,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:38:31,161 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:38:31,161 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:38:31,161 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:38:31,161 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:38:31,162 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:38:31,162 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:38:31,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:38:31,162 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:38:31,162 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:38:31,162 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:38:31,162 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:38:31,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:38:31,162 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:38:31,162 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:38:31,162 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:38:31,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:38:31,162 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:38:31,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:38:31,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:38:31,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:38:31,163 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:38:31,163 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:38:31,163 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:38:31,163 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:38:31,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:38:31,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:38:31,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:38:31,164 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:38:31,164 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:38:31,164 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/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 -> 009b18d49acf284b9866fb4283bf61c04b940d5d5b8f73fcface32bff3af3727 [2025-03-03 10:38:31,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:38:31,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:38:31,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:38:31,424 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:38:31,424 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:38:31,425 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label43.c [2025-03-03 10:38:32,574 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4f77510f/256d0552579344c088133b317ee118a7/FLAG3a5900798 [2025-03-03 10:38:32,939 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:38:32,941 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label43.c [2025-03-03 10:38:32,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4f77510f/256d0552579344c088133b317ee118a7/FLAG3a5900798 [2025-03-03 10:38:33,139 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4f77510f/256d0552579344c088133b317ee118a7 [2025-03-03 10:38:33,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:38:33,142 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:38:33,143 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:38:33,143 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:38:33,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:38:33,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:38:33" (1/1) ... [2025-03-03 10:38:33,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76be4071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:33, skipping insertion in model container [2025-03-03 10:38:33,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:38:33" (1/1) ... [2025-03-03 10:38:33,211 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:38:33,369 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label43.c[5259,5272] [2025-03-03 10:38:33,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:38:33,834 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:38:33,850 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label43.c[5259,5272] [2025-03-03 10:38:34,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:38:34,114 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:38:34,115 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:34 WrapperNode [2025-03-03 10:38:34,115 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:38:34,116 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:38:34,117 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:38:34,117 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:38:34,121 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:34" (1/1) ... [2025-03-03 10:38:34,167 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:34" (1/1) ... [2025-03-03 10:38:34,387 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-03-03 10:38:34,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:38:34,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:38:34,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:38:34,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:38:34,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:34" (1/1) ... [2025-03-03 10:38:34,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:34" (1/1) ... [2025-03-03 10:38:34,427 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:34" (1/1) ... [2025-03-03 10:38:34,570 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-03-03 10:38:34,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:34" (1/1) ... [2025-03-03 10:38:34,571 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:34" (1/1) ... [2025-03-03 10:38:34,696 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:34" (1/1) ... [2025-03-03 10:38:34,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:34" (1/1) ... [2025-03-03 10:38:34,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:34" (1/1) ... [2025-03-03 10:38:34,743 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:34" (1/1) ... [2025-03-03 10:38:34,774 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:38:34,775 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:38:34,775 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:38:34,775 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:38:34,776 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:34" (1/1) ... [2025-03-03 10:38:34,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:38:34,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:38:34,801 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:38:34,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:38:34,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:38:34,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:38:34,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:38:34,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:38:34,873 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:38:34,874 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:38:38,070 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-03-03 10:38:38,071 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-03-03 10:38:38,071 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-03-03 10:38:38,238 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-03-03 10:38:38,239 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:38:38,273 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:38:38,273 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:38:38,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:38:38 BoogieIcfgContainer [2025-03-03 10:38:38,273 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:38:38,275 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:38:38,275 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:38:38,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:38:38,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:38:33" (1/3) ... [2025-03-03 10:38:38,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f262318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:38:38, skipping insertion in model container [2025-03-03 10:38:38,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:38:34" (2/3) ... [2025-03-03 10:38:38,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f262318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:38:38, skipping insertion in model container [2025-03-03 10:38:38,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:38:38" (3/3) ... [2025-03-03 10:38:38,283 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label43.c [2025-03-03 10:38:38,295 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:38:38,296 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label43.c that has 1 procedures, 818 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:38:38,363 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:38:38,372 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;@1409fb47, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:38:38,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:38:38,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 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-03-03 10:38:38,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 10:38:38,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:38,386 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] [2025-03-03 10:38:38,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:38,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:38,392 INFO L85 PathProgramCache]: Analyzing trace with hash -55082500, now seen corresponding path program 1 times [2025-03-03 10:38:38,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:38,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098680847] [2025-03-03 10:38:38,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:38,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:38,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-03 10:38:38,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 10:38:38,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:38,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:38,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:38:38,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:38,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098680847] [2025-03-03 10:38:38,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098680847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:38:38,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:38:38,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:38:38,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716713003] [2025-03-03 10:38:38,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:38,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:38:38,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:38,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:38:38,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:38:38,695 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9166666666666667) internal successors, (1564), 817 states have internal predecessors, (1564), 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 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 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-03-03 10:38:41,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:38:41,610 INFO L93 Difference]: Finished difference Result 2388 states and 4626 transitions. [2025-03-03 10:38:41,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:38:41,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 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 41 [2025-03-03 10:38:41,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:38:41,625 INFO L225 Difference]: With dead ends: 2388 [2025-03-03 10:38:41,625 INFO L226 Difference]: Without dead ends: 1506 [2025-03-03 10:38:41,632 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-03-03 10:38:41,637 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 818 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 1058 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 3395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1058 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:38:41,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 102 Invalid, 3395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1058 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-03 10:38:41,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-03-03 10:38:41,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-03-03 10:38:41,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.869767441860465) internal successors, (2814), 1505 states have internal predecessors, (2814), 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-03-03 10:38:41,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2814 transitions. [2025-03-03 10:38:41,744 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2814 transitions. Word has length 41 [2025-03-03 10:38:41,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:38:41,745 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2814 transitions. [2025-03-03 10:38:41,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 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-03-03 10:38:41,745 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2814 transitions. [2025-03-03 10:38:41,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 10:38:41,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:41,749 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, 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] [2025-03-03 10:38:41,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:38:41,749 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:41,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:41,750 INFO L85 PathProgramCache]: Analyzing trace with hash 978666206, now seen corresponding path program 1 times [2025-03-03 10:38:41,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:41,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308325592] [2025-03-03 10:38:41,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:41,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:41,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 10:38:41,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 10:38:41,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:41,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:42,120 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:38:42,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:42,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308325592] [2025-03-03 10:38:42,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308325592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:38:42,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:38:42,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:38:42,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986386650] [2025-03-03 10:38:42,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:42,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:38:42,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:42,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:38:42,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:38:42,123 INFO L87 Difference]: Start difference. First operand 1506 states and 2814 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:45,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:38:45,930 INFO L93 Difference]: Finished difference Result 5271 states and 9820 transitions. [2025-03-03 10:38:45,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:38:45,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2025-03-03 10:38:45,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:38:45,943 INFO L225 Difference]: With dead ends: 5271 [2025-03-03 10:38:45,944 INFO L226 Difference]: Without dead ends: 3767 [2025-03-03 10:38:45,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:38:45,946 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 2296 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3612 mSolverCounterSat, 1535 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2296 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 5147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1535 IncrementalHoareTripleChecker+Valid, 3612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:38:45,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2296 Valid, 199 Invalid, 5147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1535 Valid, 3612 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-03 10:38:45,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3767 states. [2025-03-03 10:38:46,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3767 to 3759. [2025-03-03 10:38:46,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3758 states have (on average 1.6120276742948376) internal successors, (6058), 3758 states have internal predecessors, (6058), 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-03-03 10:38:46,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 6058 transitions. [2025-03-03 10:38:46,025 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 6058 transitions. Word has length 114 [2025-03-03 10:38:46,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:38:46,027 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 6058 transitions. [2025-03-03 10:38:46,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:46,027 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 6058 transitions. [2025-03-03 10:38:46,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-03 10:38:46,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:46,032 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:38:46,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:38:46,033 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:46,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:46,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1193545288, now seen corresponding path program 1 times [2025-03-03 10:38:46,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:46,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711905233] [2025-03-03 10:38:46,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:46,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:46,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 10:38:46,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 10:38:46,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:46,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:46,395 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:38:46,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:46,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711905233] [2025-03-03 10:38:46,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711905233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:38:46,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901341820] [2025-03-03 10:38:46,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:46,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:38:46,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:38:46,402 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:38:46,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:38:46,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 10:38:46,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 10:38:46,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:46,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:46,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:38:46,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:38:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 10:38:46,683 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:38:46,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901341820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:38:46,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:38:46,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-03 10:38:46,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736967199] [2025-03-03 10:38:46,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:46,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:38:46,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:46,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:38:46,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:38:46,684 INFO L87 Difference]: Start difference. First operand 3759 states and 6058 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:48,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:38:48,811 INFO L93 Difference]: Finished difference Result 9769 states and 15358 transitions. [2025-03-03 10:38:48,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:38:48,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 182 [2025-03-03 10:38:48,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:38:48,827 INFO L225 Difference]: With dead ends: 9769 [2025-03-03 10:38:48,828 INFO L226 Difference]: Without dead ends: 6012 [2025-03-03 10:38:48,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:38:48,831 INFO L435 NwaCegarLoop]: 666 mSDtfsCounter, 619 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2460 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 2877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 2460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:38:48,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 673 Invalid, 2877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 2460 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:38:48,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6012 states. [2025-03-03 10:38:48,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6012 to 5261. [2025-03-03 10:38:48,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5261 states, 5260 states have (on average 1.5376425855513307) internal successors, (8088), 5260 states have internal predecessors, (8088), 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-03-03 10:38:48,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5261 states to 5261 states and 8088 transitions. [2025-03-03 10:38:48,897 INFO L78 Accepts]: Start accepts. Automaton has 5261 states and 8088 transitions. Word has length 182 [2025-03-03 10:38:48,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:38:48,897 INFO L471 AbstractCegarLoop]: Abstraction has 5261 states and 8088 transitions. [2025-03-03 10:38:48,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:38:48,898 INFO L276 IsEmpty]: Start isEmpty. Operand 5261 states and 8088 transitions. [2025-03-03 10:38:48,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-03 10:38:48,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:48,899 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:38:48,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:38:49,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:38:49,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:49,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:49,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1759371430, now seen corresponding path program 1 times [2025-03-03 10:38:49,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:49,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762530983] [2025-03-03 10:38:49,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:49,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:49,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-03 10:38:49,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-03 10:38:49,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:49,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:49,334 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 10:38:49,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:49,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762530983] [2025-03-03 10:38:49,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762530983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:38:49,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:38:49,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:38:49,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173705449] [2025-03-03 10:38:49,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:49,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:38:49,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:49,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:38:49,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:38:49,336 INFO L87 Difference]: Start difference. First operand 5261 states and 8088 transitions. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 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-03-03 10:38:51,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:38:51,987 INFO L93 Difference]: Finished difference Result 15063 states and 23539 transitions. [2025-03-03 10:38:51,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:38:51,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 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 187 [2025-03-03 10:38:51,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:38:52,010 INFO L225 Difference]: With dead ends: 15063 [2025-03-03 10:38:52,011 INFO L226 Difference]: Without dead ends: 9767 [2025-03-03 10:38:52,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:38:52,015 INFO L435 NwaCegarLoop]: 694 mSDtfsCounter, 702 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 3836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:38:52,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 708 Invalid, 3836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 10:38:52,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2025-03-03 10:38:52,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9767. [2025-03-03 10:38:52,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.3098505017407331) internal successors, (12792), 9766 states have internal predecessors, (12792), 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-03-03 10:38:52,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 12792 transitions. [2025-03-03 10:38:52,135 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 12792 transitions. Word has length 187 [2025-03-03 10:38:52,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:38:52,135 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 12792 transitions. [2025-03-03 10:38:52,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 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-03-03 10:38:52,136 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 12792 transitions. [2025-03-03 10:38:52,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-03 10:38:52,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:52,138 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 10:38:52,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:38:52,139 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:52,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:52,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1088613495, now seen corresponding path program 1 times [2025-03-03 10:38:52,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:52,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339761969] [2025-03-03 10:38:52,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:52,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:52,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-03 10:38:52,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-03 10:38:52,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:52,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:52,300 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-03 10:38:52,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:52,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339761969] [2025-03-03 10:38:52,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339761969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:38:52,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:38:52,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:38:52,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836619014] [2025-03-03 10:38:52,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:52,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:38:52,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:52,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:38:52,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:38:52,302 INFO L87 Difference]: Start difference. First operand 9767 states and 12792 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 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-03-03 10:38:54,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:38:54,490 INFO L93 Difference]: Finished difference Result 24040 states and 32728 transitions. [2025-03-03 10:38:54,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:38:54,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 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 257 [2025-03-03 10:38:54,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:38:54,528 INFO L225 Difference]: With dead ends: 24040 [2025-03-03 10:38:54,528 INFO L226 Difference]: Without dead ends: 14275 [2025-03-03 10:38:54,539 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-03-03 10:38:54,541 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 848 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2337 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 2803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 2337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:38:54,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 376 Invalid, 2803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 2337 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:38:54,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14275 states. [2025-03-03 10:38:54,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14275 to 14273. [2025-03-03 10:38:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14273 states, 14272 states have (on average 1.3160033632286996) internal successors, (18782), 14272 states have internal predecessors, (18782), 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-03-03 10:38:54,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14273 states to 14273 states and 18782 transitions. [2025-03-03 10:38:54,789 INFO L78 Accepts]: Start accepts. Automaton has 14273 states and 18782 transitions. Word has length 257 [2025-03-03 10:38:54,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:38:54,790 INFO L471 AbstractCegarLoop]: Abstraction has 14273 states and 18782 transitions. [2025-03-03 10:38:54,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 2 states have internal predecessors, (184), 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-03-03 10:38:54,791 INFO L276 IsEmpty]: Start isEmpty. Operand 14273 states and 18782 transitions. [2025-03-03 10:38:54,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-03 10:38:54,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:54,793 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 10:38:54,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:38:54,793 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:54,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:54,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1080952450, now seen corresponding path program 1 times [2025-03-03 10:38:54,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:54,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330465213] [2025-03-03 10:38:54,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:54,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:54,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-03 10:38:54,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-03 10:38:54,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:54,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:54,921 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:38:54,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:54,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330465213] [2025-03-03 10:38:54,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330465213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:38:54,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:38:54,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:38:54,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928929738] [2025-03-03 10:38:54,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:54,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:38:54,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:54,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:38:54,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:38:54,923 INFO L87 Difference]: Start difference. First operand 14273 states and 18782 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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-03-03 10:38:57,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:38:57,182 INFO L93 Difference]: Finished difference Result 28544 states and 37562 transitions. [2025-03-03 10:38:57,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:38:57,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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 268 [2025-03-03 10:38:57,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:38:57,207 INFO L225 Difference]: With dead ends: 28544 [2025-03-03 10:38:57,207 INFO L226 Difference]: Without dead ends: 14273 [2025-03-03 10:38:57,220 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-03-03 10:38:57,220 INFO L435 NwaCegarLoop]: 1266 mSDtfsCounter, 682 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2655 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 3023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 2655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:38:57,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1273 Invalid, 3023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 2655 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:38:57,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14273 states. [2025-03-03 10:38:57,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14273 to 14273. [2025-03-03 10:38:57,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14273 states, 14272 states have (on average 1.2623318385650224) internal successors, (18016), 14272 states have internal predecessors, (18016), 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-03-03 10:38:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14273 states to 14273 states and 18016 transitions. [2025-03-03 10:38:57,495 INFO L78 Accepts]: Start accepts. Automaton has 14273 states and 18016 transitions. Word has length 268 [2025-03-03 10:38:57,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:38:57,496 INFO L471 AbstractCegarLoop]: Abstraction has 14273 states and 18016 transitions. [2025-03-03 10:38:57,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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-03-03 10:38:57,496 INFO L276 IsEmpty]: Start isEmpty. Operand 14273 states and 18016 transitions. [2025-03-03 10:38:57,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-03-03 10:38:57,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:38:57,501 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 10:38:57,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:38:57,501 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:38:57,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:38:57,502 INFO L85 PathProgramCache]: Analyzing trace with hash 2084046024, now seen corresponding path program 1 times [2025-03-03 10:38:57,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:38:57,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62693204] [2025-03-03 10:38:57,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:57,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:38:57,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 10:38:57,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 10:38:57,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:57,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:57,972 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 41 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:38:57,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:38:57,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62693204] [2025-03-03 10:38:57,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62693204] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:38:57,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750046434] [2025-03-03 10:38:57,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:38:57,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:38:57,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:38:57,976 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:38:57,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:38:58,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-03-03 10:38:58,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-03-03 10:38:58,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:38:58,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:38:58,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:38:58,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:38:58,124 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-03 10:38:58,124 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:38:58,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750046434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:38:58,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:38:58,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-03 10:38:58,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269605389] [2025-03-03 10:38:58,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:38:58,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:38:58,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:38:58,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:38:58,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:38:58,127 INFO L87 Difference]: Start difference. First operand 14273 states and 18016 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-03-03 10:39:00,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:00,408 INFO L93 Difference]: Finished difference Result 37556 states and 48447 transitions. [2025-03-03 10:39:00,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:00,408 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 272 [2025-03-03 10:39:00,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:00,437 INFO L225 Difference]: With dead ends: 37556 [2025-03-03 10:39:00,438 INFO L226 Difference]: Without dead ends: 23285 [2025-03-03 10:39:00,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:39:00,450 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 759 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2223 mSolverCounterSat, 718 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 718 IncrementalHoareTripleChecker+Valid, 2223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:00,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 376 Invalid, 2941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [718 Valid, 2223 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:39:00,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23285 states. [2025-03-03 10:39:00,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23285 to 23285. [2025-03-03 10:39:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23285 states, 23284 states have (on average 1.2509019068888507) internal successors, (29126), 23284 states have internal predecessors, (29126), 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-03-03 10:39:00,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23285 states to 23285 states and 29126 transitions. [2025-03-03 10:39:00,646 INFO L78 Accepts]: Start accepts. Automaton has 23285 states and 29126 transitions. Word has length 272 [2025-03-03 10:39:00,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:00,648 INFO L471 AbstractCegarLoop]: Abstraction has 23285 states and 29126 transitions. [2025-03-03 10:39:00,648 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-03-03 10:39:00,648 INFO L276 IsEmpty]: Start isEmpty. Operand 23285 states and 29126 transitions. [2025-03-03 10:39:00,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-03-03 10:39:00,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:00,652 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:39:00,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:39:00,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-03 10:39:00,853 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:00,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:00,853 INFO L85 PathProgramCache]: Analyzing trace with hash -932365258, now seen corresponding path program 1 times [2025-03-03 10:39:00,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:00,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776459664] [2025-03-03 10:39:00,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:00,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:00,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-03-03 10:39:00,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-03-03 10:39:00,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:00,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:01,073 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 10:39:01,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:01,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776459664] [2025-03-03 10:39:01,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776459664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:01,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:01,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:39:01,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422180841] [2025-03-03 10:39:01,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:01,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:01,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:01,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:01,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:01,076 INFO L87 Difference]: Start difference. First operand 23285 states and 29126 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-03-03 10:39:03,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:03,455 INFO L93 Difference]: Finished difference Result 66094 states and 83272 transitions. [2025-03-03 10:39:03,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:03,455 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 303 [2025-03-03 10:39:03,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:03,501 INFO L225 Difference]: With dead ends: 66094 [2025-03-03 10:39:03,501 INFO L226 Difference]: Without dead ends: 42811 [2025-03-03 10:39:03,518 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-03-03 10:39:03,518 INFO L435 NwaCegarLoop]: 1403 mSDtfsCounter, 713 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 1411 SdHoareTripleChecker+Invalid, 2893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:03,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 1411 Invalid, 2893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 10:39:03,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42811 states. [2025-03-03 10:39:03,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42811 to 42811. [2025-03-03 10:39:03,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42811 states, 42810 states have (on average 1.1685353889278205) internal successors, (50025), 42810 states have internal predecessors, (50025), 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-03-03 10:39:03,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42811 states to 42811 states and 50025 transitions. [2025-03-03 10:39:03,881 INFO L78 Accepts]: Start accepts. Automaton has 42811 states and 50025 transitions. Word has length 303 [2025-03-03 10:39:03,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:03,881 INFO L471 AbstractCegarLoop]: Abstraction has 42811 states and 50025 transitions. [2025-03-03 10:39:03,882 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-03-03 10:39:03,882 INFO L276 IsEmpty]: Start isEmpty. Operand 42811 states and 50025 transitions. [2025-03-03 10:39:03,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-03-03 10:39:03,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:03,887 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:39:03,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:39:03,888 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:03,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:03,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1702903564, now seen corresponding path program 1 times [2025-03-03 10:39:03,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:03,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221432458] [2025-03-03 10:39:03,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:03,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:03,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-03 10:39:03,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-03 10:39:03,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:03,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:04,057 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-03 10:39:04,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:04,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221432458] [2025-03-03 10:39:04,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221432458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:04,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:04,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:39:04,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118865927] [2025-03-03 10:39:04,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:04,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:04,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:04,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:04,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:04,059 INFO L87 Difference]: Start difference. First operand 42811 states and 50025 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 2 states have internal predecessors, (220), 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-03-03 10:39:06,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:06,315 INFO L93 Difference]: Finished difference Result 105146 states and 125173 transitions. [2025-03-03 10:39:06,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:06,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 2 states have internal predecessors, (220), 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 363 [2025-03-03 10:39:06,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:06,377 INFO L225 Difference]: With dead ends: 105146 [2025-03-03 10:39:06,377 INFO L226 Difference]: Without dead ends: 62337 [2025-03-03 10:39:06,410 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-03-03 10:39:06,410 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 660 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 860 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 860 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:06,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 428 Invalid, 2833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [860 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:39:06,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62337 states. [2025-03-03 10:39:06,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62337 to 55578. [2025-03-03 10:39:06,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55578 states, 55577 states have (on average 1.1561077424114292) internal successors, (64253), 55577 states have internal predecessors, (64253), 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-03-03 10:39:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55578 states to 55578 states and 64253 transitions. [2025-03-03 10:39:07,049 INFO L78 Accepts]: Start accepts. Automaton has 55578 states and 64253 transitions. Word has length 363 [2025-03-03 10:39:07,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:07,049 INFO L471 AbstractCegarLoop]: Abstraction has 55578 states and 64253 transitions. [2025-03-03 10:39:07,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 2 states have internal predecessors, (220), 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-03-03 10:39:07,050 INFO L276 IsEmpty]: Start isEmpty. Operand 55578 states and 64253 transitions. [2025-03-03 10:39:07,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-03-03 10:39:07,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:07,058 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 10:39:07,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:39:07,059 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:07,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:07,059 INFO L85 PathProgramCache]: Analyzing trace with hash -327168631, now seen corresponding path program 1 times [2025-03-03 10:39:07,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:07,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211519448] [2025-03-03 10:39:07,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:07,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:07,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-03-03 10:39:07,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-03-03 10:39:07,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:07,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:07,490 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-03 10:39:07,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:07,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211519448] [2025-03-03 10:39:07,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211519448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:07,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:07,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:39:07,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575195286] [2025-03-03 10:39:07,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:07,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:07,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:07,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:07,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:07,493 INFO L87 Difference]: Start difference. First operand 55578 states and 64253 transitions. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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-03-03 10:39:09,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:09,562 INFO L93 Difference]: Finished difference Result 124672 states and 143536 transitions. [2025-03-03 10:39:09,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:09,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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 426 [2025-03-03 10:39:09,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:09,636 INFO L225 Difference]: With dead ends: 124672 [2025-03-03 10:39:09,636 INFO L226 Difference]: Without dead ends: 69096 [2025-03-03 10:39:09,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-03-03 10:39:09,666 INFO L435 NwaCegarLoop]: 901 mSDtfsCounter, 827 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2137 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 2732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 2137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:09,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 909 Invalid, 2732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 2137 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 10:39:09,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69096 states. [2025-03-03 10:39:10,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69096 to 66092. [2025-03-03 10:39:10,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66092 states, 66091 states have (on average 1.126537652630464) internal successors, (74454), 66091 states have internal predecessors, (74454), 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-03-03 10:39:10,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66092 states to 66092 states and 74454 transitions. [2025-03-03 10:39:10,172 INFO L78 Accepts]: Start accepts. Automaton has 66092 states and 74454 transitions. Word has length 426 [2025-03-03 10:39:10,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:10,172 INFO L471 AbstractCegarLoop]: Abstraction has 66092 states and 74454 transitions. [2025-03-03 10:39:10,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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-03-03 10:39:10,173 INFO L276 IsEmpty]: Start isEmpty. Operand 66092 states and 74454 transitions. [2025-03-03 10:39:10,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-03-03 10:39:10,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:10,179 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 10:39:10,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:39:10,179 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:10,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:10,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2103664929, now seen corresponding path program 1 times [2025-03-03 10:39:10,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:10,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19793869] [2025-03-03 10:39:10,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:10,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:10,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-03-03 10:39:10,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-03-03 10:39:10,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:10,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:10,588 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 196 proven. 303 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-03 10:39:10,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:10,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19793869] [2025-03-03 10:39:10,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19793869] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:39:10,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902749303] [2025-03-03 10:39:10,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:10,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:39:10,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:39:10,591 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:39:10,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 10:39:10,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-03-03 10:39:10,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-03-03 10:39:10,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:10,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:10,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 601 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:39:10,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:39:10,771 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-03-03 10:39:10,771 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:39:10,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902749303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:10,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:39:10,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:39:10,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274542410] [2025-03-03 10:39:10,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:10,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:10,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:10,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:10,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:39:10,773 INFO L87 Difference]: Start difference. First operand 66092 states and 74454 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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-03-03 10:39:13,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:13,116 INFO L93 Difference]: Finished difference Result 148704 states and 168933 transitions. [2025-03-03 10:39:13,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:13,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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 449 [2025-03-03 10:39:13,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:13,197 INFO L225 Difference]: With dead ends: 148704 [2025-03-03 10:39:13,197 INFO L226 Difference]: Without dead ends: 82614 [2025-03-03 10:39:13,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:39:13,225 INFO L435 NwaCegarLoop]: 1109 mSDtfsCounter, 833 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2198 mSolverCounterSat, 567 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 567 IncrementalHoareTripleChecker+Valid, 2198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:13,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1117 Invalid, 2765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [567 Valid, 2198 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-03 10:39:13,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82614 states. [2025-03-03 10:39:13,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82614 to 82614. [2025-03-03 10:39:13,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82614 states, 82613 states have (on average 1.11712442351688) internal successors, (92289), 82613 states have internal predecessors, (92289), 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-03-03 10:39:14,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82614 states to 82614 states and 92289 transitions. [2025-03-03 10:39:14,095 INFO L78 Accepts]: Start accepts. Automaton has 82614 states and 92289 transitions. Word has length 449 [2025-03-03 10:39:14,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:14,096 INFO L471 AbstractCegarLoop]: Abstraction has 82614 states and 92289 transitions. [2025-03-03 10:39:14,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 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-03-03 10:39:14,096 INFO L276 IsEmpty]: Start isEmpty. Operand 82614 states and 92289 transitions. [2025-03-03 10:39:14,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1037 [2025-03-03 10:39:14,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:14,182 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 10:39:14,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 10:39:14,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:39:14,382 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:14,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:14,383 INFO L85 PathProgramCache]: Analyzing trace with hash -840590366, now seen corresponding path program 1 times [2025-03-03 10:39:14,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:14,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212546868] [2025-03-03 10:39:14,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:14,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:14,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1036 statements into 1 equivalence classes. [2025-03-03 10:39:14,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1036 of 1036 statements. [2025-03-03 10:39:14,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:14,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:15,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 603 proven. 303 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-03-03 10:39:15,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:15,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212546868] [2025-03-03 10:39:15,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212546868] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:39:15,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048495804] [2025-03-03 10:39:15,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:15,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:39:15,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:39:15,362 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:39:15,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 10:39:15,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1036 statements into 1 equivalence classes. [2025-03-03 10:39:15,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1036 of 1036 statements. [2025-03-03 10:39:15,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:15,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:15,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 1229 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:39:15,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:39:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1085 backedges. 860 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-03 10:39:15,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:39:15,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048495804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:15,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:39:15,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:39:15,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333529460] [2025-03-03 10:39:15,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:15,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:15,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:15,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:15,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:39:15,851 INFO L87 Difference]: Start difference. First operand 82614 states and 92289 transitions. Second operand has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 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-03-03 10:39:18,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:18,152 INFO L93 Difference]: Finished difference Result 185503 states and 209301 transitions. [2025-03-03 10:39:18,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:18,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 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 1036 [2025-03-03 10:39:18,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:18,276 INFO L225 Difference]: With dead ends: 185503 [2025-03-03 10:39:18,276 INFO L226 Difference]: Without dead ends: 102891 [2025-03-03 10:39:18,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1039 GetRequests, 1035 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:39:18,331 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 784 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 788 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 2863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 788 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:18,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 256 Invalid, 2863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [788 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:39:18,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102891 states. [2025-03-03 10:39:19,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102891 to 102891. [2025-03-03 10:39:19,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102891 states, 102890 states have (on average 1.111750413062494) internal successors, (114388), 102890 states have internal predecessors, (114388), 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-03-03 10:39:19,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102891 states to 102891 states and 114388 transitions. [2025-03-03 10:39:19,585 INFO L78 Accepts]: Start accepts. Automaton has 102891 states and 114388 transitions. Word has length 1036 [2025-03-03 10:39:19,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:19,586 INFO L471 AbstractCegarLoop]: Abstraction has 102891 states and 114388 transitions. [2025-03-03 10:39:19,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 271.3333333333333) internal successors, (814), 3 states have internal predecessors, (814), 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-03-03 10:39:19,586 INFO L276 IsEmpty]: Start isEmpty. Operand 102891 states and 114388 transitions. [2025-03-03 10:39:19,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1047 [2025-03-03 10:39:19,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:19,653 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 10:39:19,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 10:39:19,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:39:19,853 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:19,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:19,854 INFO L85 PathProgramCache]: Analyzing trace with hash -178568696, now seen corresponding path program 1 times [2025-03-03 10:39:19,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:19,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237523464] [2025-03-03 10:39:19,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:19,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:19,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1046 statements into 1 equivalence classes. [2025-03-03 10:39:19,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1046 of 1046 statements. [2025-03-03 10:39:19,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:19,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:21,343 INFO L134 CoverageAnalysis]: Checked inductivity of 873 backedges. 572 proven. 0 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2025-03-03 10:39:21,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:21,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237523464] [2025-03-03 10:39:21,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237523464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:21,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:21,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 10:39:21,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792748770] [2025-03-03 10:39:21,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:21,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 10:39:21,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:21,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 10:39:21,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:39:21,346 INFO L87 Difference]: Start difference. First operand 102891 states and 114388 transitions. Second operand has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 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-03-03 10:39:27,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:27,741 INFO L93 Difference]: Finished difference Result 288865 states and 320650 transitions. [2025-03-03 10:39:27,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 10:39:27,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 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 1046 [2025-03-03 10:39:27,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:27,987 INFO L225 Difference]: With dead ends: 288865 [2025-03-03 10:39:27,987 INFO L226 Difference]: Without dead ends: 184468 [2025-03-03 10:39:28,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2025-03-03 10:39:28,072 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 1946 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 8400 mSolverCounterSat, 2949 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1946 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 11349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2949 IncrementalHoareTripleChecker+Valid, 8400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:28,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1946 Valid, 672 Invalid, 11349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2949 Valid, 8400 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-03-03 10:39:28,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184468 states. [2025-03-03 10:39:29,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184468 to 104393. [2025-03-03 10:39:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104393 states, 104392 states have (on average 1.1103149666641121) internal successors, (115908), 104392 states have internal predecessors, (115908), 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-03-03 10:39:29,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104393 states to 104393 states and 115908 transitions. [2025-03-03 10:39:29,781 INFO L78 Accepts]: Start accepts. Automaton has 104393 states and 115908 transitions. Word has length 1046 [2025-03-03 10:39:29,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:29,782 INFO L471 AbstractCegarLoop]: Abstraction has 104393 states and 115908 transitions. [2025-03-03 10:39:29,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.5) internal successors, (825), 6 states have internal predecessors, (825), 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-03-03 10:39:29,782 INFO L276 IsEmpty]: Start isEmpty. Operand 104393 states and 115908 transitions. [2025-03-03 10:39:29,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2025-03-03 10:39:29,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:29,845 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 10:39:29,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:39:29,845 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:29,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:29,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1775077687, now seen corresponding path program 1 times [2025-03-03 10:39:29,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:29,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785006210] [2025-03-03 10:39:29,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:29,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:29,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1066 statements into 1 equivalence classes. [2025-03-03 10:39:29,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1066 of 1066 statements. [2025-03-03 10:39:29,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:29,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:30,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 633 proven. 333 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-03-03 10:39:30,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:30,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785006210] [2025-03-03 10:39:30,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785006210] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:39:30,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712239309] [2025-03-03 10:39:30,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:30,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:39:30,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:39:30,658 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:39:30,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 10:39:30,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1066 statements into 1 equivalence classes. [2025-03-03 10:39:30,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1066 of 1066 statements. [2025-03-03 10:39:30,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:30,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:30,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 1259 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:39:30,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:39:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 950 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2025-03-03 10:39:31,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:39:31,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712239309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:31,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:39:31,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:39:31,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16048795] [2025-03-03 10:39:31,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:31,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:31,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:31,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:31,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:39:31,028 INFO L87 Difference]: Start difference. First operand 104393 states and 115908 transitions. Second operand has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 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-03-03 10:39:33,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:33,614 INFO L93 Difference]: Finished difference Result 244832 states and 273493 transitions. [2025-03-03 10:39:33,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:33,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 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 1066 [2025-03-03 10:39:33,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:33,767 INFO L225 Difference]: With dead ends: 244832 [2025-03-03 10:39:33,767 INFO L226 Difference]: Without dead ends: 140441 [2025-03-03 10:39:33,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1069 GetRequests, 1065 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:39:33,839 INFO L435 NwaCegarLoop]: 1282 mSDtfsCounter, 661 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2333 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 2864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 2333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:33,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1290 Invalid, 2864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 2333 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:39:33,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140441 states. [2025-03-03 10:39:35,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140441 to 138188. [2025-03-03 10:39:35,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138188 states, 138187 states have (on average 1.0983377597024322) internal successors, (151776), 138187 states have internal predecessors, (151776), 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-03-03 10:39:35,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138188 states to 138188 states and 151776 transitions. [2025-03-03 10:39:35,525 INFO L78 Accepts]: Start accepts. Automaton has 138188 states and 151776 transitions. Word has length 1066 [2025-03-03 10:39:35,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:35,526 INFO L471 AbstractCegarLoop]: Abstraction has 138188 states and 151776 transitions. [2025-03-03 10:39:35,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 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-03-03 10:39:35,526 INFO L276 IsEmpty]: Start isEmpty. Operand 138188 states and 151776 transitions. [2025-03-03 10:39:35,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1126 [2025-03-03 10:39:35,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:39:35,612 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 10:39:35,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 10:39:35,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 10:39:35,812 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:39:35,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:39:35,813 INFO L85 PathProgramCache]: Analyzing trace with hash -25489365, now seen corresponding path program 1 times [2025-03-03 10:39:35,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:39:35,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653914321] [2025-03-03 10:39:35,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:39:35,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:39:35,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1125 statements into 1 equivalence classes. [2025-03-03 10:39:35,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1125 of 1125 statements. [2025-03-03 10:39:35,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:39:35,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:39:36,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1294 backedges. 690 proven. 0 refuted. 0 times theorem prover too weak. 604 trivial. 0 not checked. [2025-03-03 10:39:36,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:39:36,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653914321] [2025-03-03 10:39:36,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653914321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:39:36,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:39:36,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:39:36,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23003767] [2025-03-03 10:39:36,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:39:36,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:39:36,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:39:36,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:39:36,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:39:36,608 INFO L87 Difference]: Start difference. First operand 138188 states and 151776 transitions. Second operand has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 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-03-03 10:39:39,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:39:39,158 INFO L93 Difference]: Finished difference Result 280878 states and 308117 transitions. [2025-03-03 10:39:39,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:39:39,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 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 1125 [2025-03-03 10:39:39,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:39:39,161 INFO L225 Difference]: With dead ends: 280878 [2025-03-03 10:39:39,161 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:39:39,254 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-03-03 10:39:39,255 INFO L435 NwaCegarLoop]: 1221 mSDtfsCounter, 230 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2169 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 2714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 2169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:39:39,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1228 Invalid, 2714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 2169 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:39:39,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:39:39,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:39:39,255 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-03-03 10:39:39,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:39:39,256 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1125 [2025-03-03 10:39:39,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:39:39,256 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:39:39,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 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-03-03 10:39:39,256 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:39:39,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:39:39,258 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:39:39,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:39:39,261 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:39:39,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:39:46,167 WARN L286 SmtUtils]: Spent 6.90s on a formula simplification. DAG size of input: 583 DAG size of output: 466 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-03 10:39:47,763 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:39:47,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:39:47 BoogieIcfgContainer [2025-03-03 10:39:47,779 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:39:47,780 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:39:47,780 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:39:47,780 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:39:47,780 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:38:38" (3/4) ... [2025-03-03 10:39:47,782 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:39:47,820 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-03 10:39:47,825 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:39:47,829 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:39:47,833 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:39:48,079 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:39:48,079 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:39:48,079 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:39:48,080 INFO L158 Benchmark]: Toolchain (without parser) took 74938.11ms. Allocated memory was 167.8MB in the beginning and 3.1GB in the end (delta: 2.9GB). Free memory was 110.8MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 906.9MB. Max. memory is 16.1GB. [2025-03-03 10:39:48,080 INFO L158 Benchmark]: CDTParser took 0.59ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:39:48,081 INFO L158 Benchmark]: CACSL2BoogieTranslator took 972.95ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 97.5MB in the end (delta: 13.3MB). Peak memory consumption was 104.7MB. Max. memory is 16.1GB. [2025-03-03 10:39:48,081 INFO L158 Benchmark]: Boogie Procedure Inliner took 271.97ms. Allocated memory is still 167.8MB. Free memory was 97.5MB in the beginning and 58.7MB in the end (delta: 38.8MB). Peak memory consumption was 77.8MB. Max. memory is 16.1GB. [2025-03-03 10:39:48,081 INFO L158 Benchmark]: Boogie Preprocessor took 386.00ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 58.7MB in the beginning and 313.4MB in the end (delta: -254.7MB). Peak memory consumption was 94.1MB. Max. memory is 16.1GB. [2025-03-03 10:39:48,081 INFO L158 Benchmark]: IcfgBuilder took 3498.58ms. Allocated memory was 436.2MB in the beginning and 872.4MB in the end (delta: 436.2MB). Free memory was 313.4MB in the beginning and 583.4MB in the end (delta: -270.0MB). Peak memory consumption was 241.9MB. Max. memory is 16.1GB. [2025-03-03 10:39:48,081 INFO L158 Benchmark]: TraceAbstraction took 69503.91ms. Allocated memory was 872.4MB in the beginning and 3.1GB in the end (delta: 2.2GB). Free memory was 583.4MB in the beginning and 2.2GB in the end (delta: -1.6GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. [2025-03-03 10:39:48,082 INFO L158 Benchmark]: Witness Printer took 299.91ms. Allocated memory is still 3.1GB. Free memory was 2.2GB in the beginning and 2.1GB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-03 10:39:48,084 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.59ms. Allocated memory is still 201.3MB. Free memory is still 116.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 972.95ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 97.5MB in the end (delta: 13.3MB). Peak memory consumption was 104.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 271.97ms. Allocated memory is still 167.8MB. Free memory was 97.5MB in the beginning and 58.7MB in the end (delta: 38.8MB). Peak memory consumption was 77.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 386.00ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 58.7MB in the beginning and 313.4MB in the end (delta: -254.7MB). Peak memory consumption was 94.1MB. Max. memory is 16.1GB. * IcfgBuilder took 3498.58ms. Allocated memory was 436.2MB in the beginning and 872.4MB in the end (delta: 436.2MB). Free memory was 313.4MB in the beginning and 583.4MB in the end (delta: -270.0MB). Peak memory consumption was 241.9MB. Max. memory is 16.1GB. * TraceAbstraction took 69503.91ms. Allocated memory was 872.4MB in the beginning and 3.1GB in the end (delta: 2.2GB). Free memory was 583.4MB in the beginning and 2.2GB in the end (delta: -1.6GB). Peak memory consumption was 3.1GB. Max. memory is 16.1GB. * Witness Printer took 299.91ms. Allocated memory is still 3.1GB. Free memory was 2.2GB in the beginning and 2.1GB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. 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: 145]: 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, 818 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 60.9s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 42.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13378 SdHoareTripleChecker+Valid, 36.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13378 mSDsluCounter, 11018 SdHoareTripleChecker+Invalid, 30.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 165 mSDsCounter, 12665 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42370 IncrementalHoareTripleChecker+Invalid, 55035 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12665 mSolverCounterUnsat, 10853 mSDtfsCounter, 42370 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3072 GetRequests, 3024 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138188occurred in iteration=14, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 92852 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 10140 NumberOfCodeBlocks, 10140 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 10120 ConstructedInterpolants, 0 QuantifiedInterpolants, 34361 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3725 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 20 InterpolantComputations, 15 PerfectInterpolantSequences, 8396/9494 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: 4828]: Location Invariant Derived location invariant: (((((((((a5 != 4) || ((a2 <= 170) && (a24 == 14))) || ((a2 <= 170) && (a7 <= 13))) || (((14 <= a7) && (a17 <= 111)) && (a24 != 14))) || (((a24 == 14) && (a7 <= 13)) && (a17 <= 111))) || ((a7 <= 13) && (15 <= a24))) || ((a2 <= 170) && (15 <= a24))) || (190 <= a2)) || ((256 <= a17) && (15 <= a24))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:39:48,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE