./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label56.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/Problem13_label56.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 21992ce5086310b9eccd33893912bc55e4a94502535426b80db5bcf53a1c73cc --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:04:28,857 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:04:28,908 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:04:28,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:04:28,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:04:28,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:04:28,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:04:28,935 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:04:28,936 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:04:28,936 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:04:28,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:04:28,936 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:04:28,936 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:04:28,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:04:28,937 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:04:28,937 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:04:28,937 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:04:28,938 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:04:28,938 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:04:28,938 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:04:28,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:04:28,938 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:04:28,938 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:04:28,938 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:04:28,938 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:04:28,938 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:04:28,938 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:04:28,938 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:04:28,938 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:04:28,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:04:28,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:04:28,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:04:28,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:04:28,939 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:04:28,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:04:28,939 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:04:28,939 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:04:28,939 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:04:28,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:04:28,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:04:28,940 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:04:28,940 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:04:28,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:04:28,940 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 -> 21992ce5086310b9eccd33893912bc55e4a94502535426b80db5bcf53a1c73cc [2025-03-16 15:04:29,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:04:29,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:04:29,167 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:04:29,167 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:04:29,168 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:04:29,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label56.c [2025-03-16 15:04:30,248 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a64639a8/0e650a1ec8484baa9620e5e137d3cfe3/FLAGe0f8e50e2 [2025-03-16 15:04:30,703 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:04:30,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label56.c [2025-03-16 15:04:30,745 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a64639a8/0e650a1ec8484baa9620e5e137d3cfe3/FLAGe0f8e50e2 [2025-03-16 15:04:30,813 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a64639a8/0e650a1ec8484baa9620e5e137d3cfe3 [2025-03-16 15:04:30,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:04:30,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:04:30,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:04:30,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:04:30,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:04:30,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:04:30" (1/1) ... [2025-03-16 15:04:30,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f99ca09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:30, skipping insertion in model container [2025-03-16 15:04:30,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:04:30" (1/1) ... [2025-03-16 15:04:30,902 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:04:31,111 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/Problem13_label56.c[7559,7572] [2025-03-16 15:04:31,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:04:31,634 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:04:31,646 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/Problem13_label56.c[7559,7572] [2025-03-16 15:04:31,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:04:31,937 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:04:31,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:31 WrapperNode [2025-03-16 15:04:31,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:04:31,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:04:31,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:04:31,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:04:31,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:31" (1/1) ... [2025-03-16 15:04:31,986 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:31" (1/1) ... [2025-03-16 15:04:32,330 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-03-16 15:04:32,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:04:32,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:04:32,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:04:32,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:04:32,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:31" (1/1) ... [2025-03-16 15:04:32,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:31" (1/1) ... [2025-03-16 15:04:32,426 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:31" (1/1) ... [2025-03-16 15:04:32,679 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-16 15:04:32,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:31" (1/1) ... [2025-03-16 15:04:32,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:31" (1/1) ... [2025-03-16 15:04:32,801 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:31" (1/1) ... [2025-03-16 15:04:32,818 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:31" (1/1) ... [2025-03-16 15:04:32,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:31" (1/1) ... [2025-03-16 15:04:32,857 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:31" (1/1) ... [2025-03-16 15:04:32,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:04:32,902 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:04:32,902 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:04:32,903 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:04:32,904 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:31" (1/1) ... [2025-03-16 15:04:32,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:04:32,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:04:32,929 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-16 15:04:32,932 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-16 15:04:32,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:04:32,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:04:32,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:04:32,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:04:32,999 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:04:33,001 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:04:37,089 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-03-16 15:04:37,089 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-03-16 15:04:37,090 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-03-16 15:04:37,309 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-03-16 15:04:37,309 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:04:37,343 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:04:37,345 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:04:37,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:04:37 BoogieIcfgContainer [2025-03-16 15:04:37,345 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:04:37,347 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:04:37,347 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:04:37,351 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:04:37,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:04:30" (1/3) ... [2025-03-16 15:04:37,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70660668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:04:37, skipping insertion in model container [2025-03-16 15:04:37,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:04:31" (2/3) ... [2025-03-16 15:04:37,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70660668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:04:37, skipping insertion in model container [2025-03-16 15:04:37,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:04:37" (3/3) ... [2025-03-16 15:04:37,352 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label56.c [2025-03-16 15:04:37,362 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:04:37,363 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label56.c that has 1 procedures, 1037 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:04:37,438 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:04:37,447 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;@7107b592, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:04:37,447 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:04:37,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 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-16 15:04:37,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 15:04:37,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:37,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:04:37,460 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:37,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:37,465 INFO L85 PathProgramCache]: Analyzing trace with hash 492530858, now seen corresponding path program 1 times [2025-03-16 15:04:37,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:37,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596251818] [2025-03-16 15:04:37,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:37,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:37,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 15:04:37,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 15:04:37,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:37,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:37,582 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-16 15:04:37,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:37,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596251818] [2025-03-16 15:04:37,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596251818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:37,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:37,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:04:37,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681843810] [2025-03-16 15:04:37,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:37,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:04:37,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:37,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:04:37,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:04:37,610 INFO L87 Difference]: Start difference. First operand has 1037 states, 1035 states have (on average 1.8753623188405797) internal successors, (1941), 1036 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-16 15:04:37,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:37,687 INFO L93 Difference]: Finished difference Result 2073 states and 3881 transitions. [2025-03-16 15:04:37,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:04:37,688 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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 52 [2025-03-16 15:04:37,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:37,702 INFO L225 Difference]: With dead ends: 2073 [2025-03-16 15:04:37,703 INFO L226 Difference]: Without dead ends: 1034 [2025-03-16 15:04:37,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:04:37,712 INFO L435 NwaCegarLoop]: 1879 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1879 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:37,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:04:37,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2025-03-16 15:04:37,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2025-03-16 15:04:37,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 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-16 15:04:37,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2025-03-16 15:04:37,784 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 52 [2025-03-16 15:04:37,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:37,784 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2025-03-16 15:04:37,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-16 15:04:37,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2025-03-16 15:04:37,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 15:04:37,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:37,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:04:37,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:04:37,785 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:37,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:37,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1916168587, now seen corresponding path program 1 times [2025-03-16 15:04:37,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:37,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224818189] [2025-03-16 15:04:37,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:37,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:37,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 15:04:37,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 15:04:37,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:37,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:38,153 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-16 15:04:38,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:38,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224818189] [2025-03-16 15:04:38,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224818189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:38,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:38,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:04:38,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692997739] [2025-03-16 15:04:38,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:38,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:04:38,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:38,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:04:38,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:04:38,157 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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-16 15:04:42,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:42,960 INFO L93 Difference]: Finished difference Result 3696 states and 6823 transitions. [2025-03-16 15:04:42,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:04:42,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2025-03-16 15:04:42,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:42,969 INFO L225 Difference]: With dead ends: 3696 [2025-03-16 15:04:42,969 INFO L226 Difference]: Without dead ends: 2663 [2025-03-16 15:04:42,970 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-16 15:04:42,970 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 2656 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 4126 mSolverCounterSat, 1487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2656 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 5613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1487 IncrementalHoareTripleChecker+Valid, 4126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:42,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2656 Valid, 1002 Invalid, 5613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1487 Valid, 4126 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-16 15:04:42,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2025-03-16 15:04:43,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2662. [2025-03-16 15:04:43,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2662 states, 2661 states have (on average 1.4611048478015785) internal successors, (3888), 2661 states have internal predecessors, (3888), 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-16 15:04:43,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 3888 transitions. [2025-03-16 15:04:43,024 INFO L78 Accepts]: Start accepts. Automaton has 2662 states and 3888 transitions. Word has length 52 [2025-03-16 15:04:43,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:43,024 INFO L471 AbstractCegarLoop]: Abstraction has 2662 states and 3888 transitions. [2025-03-16 15:04:43,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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-16 15:04:43,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 3888 transitions. [2025-03-16 15:04:43,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-16 15:04:43,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:43,029 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, 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] [2025-03-16 15:04:43,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:04:43,029 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:43,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:43,030 INFO L85 PathProgramCache]: Analyzing trace with hash 2061426751, now seen corresponding path program 1 times [2025-03-16 15:04:43,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:43,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132061663] [2025-03-16 15:04:43,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:43,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:43,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-16 15:04:43,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-16 15:04:43,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:43,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:43,667 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:04:43,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:43,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132061663] [2025-03-16 15:04:43,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132061663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:04:43,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792964337] [2025-03-16 15:04:43,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:43,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:04:43,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:04:43,670 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-16 15:04:43,671 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-16 15:04:43,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-16 15:04:43,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-16 15:04:43,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:43,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:43,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:04:43,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:04:43,983 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-16 15:04:43,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:04:43,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792964337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:43,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:04:43,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-16 15:04:43,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327787267] [2025-03-16 15:04:43,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:43,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:43,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:43,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:43,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:04:43,986 INFO L87 Difference]: Start difference. First operand 2662 states and 3888 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 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-16 15:04:46,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:46,633 INFO L93 Difference]: Finished difference Result 6141 states and 9711 transitions. [2025-03-16 15:04:46,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:46,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 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 177 [2025-03-16 15:04:46,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:46,679 INFO L225 Difference]: With dead ends: 6141 [2025-03-16 15:04:46,682 INFO L226 Difference]: Without dead ends: 4267 [2025-03-16 15:04:46,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:04:46,685 INFO L435 NwaCegarLoop]: 1037 mSDtfsCounter, 743 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 2508 mSolverCounterSat, 778 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 778 IncrementalHoareTripleChecker+Valid, 2508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:46,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1186 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [778 Valid, 2508 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:04:46,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4267 states. [2025-03-16 15:04:46,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4267 to 4253. [2025-03-16 15:04:46,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4253 states, 4252 states have (on average 1.351599247412982) internal successors, (5747), 4252 states have internal predecessors, (5747), 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-16 15:04:46,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4253 states to 4253 states and 5747 transitions. [2025-03-16 15:04:46,767 INFO L78 Accepts]: Start accepts. Automaton has 4253 states and 5747 transitions. Word has length 177 [2025-03-16 15:04:46,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:46,768 INFO L471 AbstractCegarLoop]: Abstraction has 4253 states and 5747 transitions. [2025-03-16 15:04:46,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 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-16 15:04:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 4253 states and 5747 transitions. [2025-03-16 15:04:46,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-16 15:04:46,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:46,774 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, 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, 1, 1, 1, 1, 1, 1, 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-16 15:04:46,782 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-16 15:04:46,975 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-16 15:04:46,976 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:46,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:46,977 INFO L85 PathProgramCache]: Analyzing trace with hash -692634594, now seen corresponding path program 1 times [2025-03-16 15:04:46,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:46,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344727949] [2025-03-16 15:04:46,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:46,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:46,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-16 15:04:47,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-16 15:04:47,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:47,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:47,141 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-16 15:04:47,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:47,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344727949] [2025-03-16 15:04:47,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344727949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:47,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:47,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:04:47,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749243423] [2025-03-16 15:04:47,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:47,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:47,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:47,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:47,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:04:47,143 INFO L87 Difference]: Start difference. First operand 4253 states and 5747 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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-16 15:04:49,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:49,861 INFO L93 Difference]: Finished difference Result 10898 states and 15274 transitions. [2025-03-16 15:04:49,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:49,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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 219 [2025-03-16 15:04:49,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:49,881 INFO L225 Difference]: With dead ends: 10898 [2025-03-16 15:04:49,881 INFO L226 Difference]: Without dead ends: 7433 [2025-03-16 15:04:49,884 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-16 15:04:49,885 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 906 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2568 mSolverCounterSat, 754 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 3322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 754 IncrementalHoareTripleChecker+Valid, 2568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:49,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 956 Invalid, 3322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [754 Valid, 2568 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:04:49,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7433 states. [2025-03-16 15:04:49,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7433 to 7425. [2025-03-16 15:04:49,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7425 states, 7424 states have (on average 1.288927801724138) internal successors, (9569), 7424 states have internal predecessors, (9569), 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-16 15:04:49,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7425 states to 7425 states and 9569 transitions. [2025-03-16 15:04:49,990 INFO L78 Accepts]: Start accepts. Automaton has 7425 states and 9569 transitions. Word has length 219 [2025-03-16 15:04:49,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:49,990 INFO L471 AbstractCegarLoop]: Abstraction has 7425 states and 9569 transitions. [2025-03-16 15:04:49,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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-16 15:04:49,991 INFO L276 IsEmpty]: Start isEmpty. Operand 7425 states and 9569 transitions. [2025-03-16 15:04:49,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-16 15:04:49,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:49,993 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:04:49,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:04:49,993 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:49,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:49,993 INFO L85 PathProgramCache]: Analyzing trace with hash 963099909, now seen corresponding path program 1 times [2025-03-16 15:04:49,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:49,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428247695] [2025-03-16 15:04:49,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:49,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:50,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-16 15:04:50,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-16 15:04:50,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:50,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 15:04:50,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:50,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428247695] [2025-03-16 15:04:50,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428247695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:50,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:50,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:04:50,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736110762] [2025-03-16 15:04:50,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:50,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:50,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:50,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:50,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:04:50,143 INFO L87 Difference]: Start difference. First operand 7425 states and 9569 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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-16 15:04:52,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:52,935 INFO L93 Difference]: Finished difference Result 19620 states and 25904 transitions. [2025-03-16 15:04:52,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:52,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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 233 [2025-03-16 15:04:52,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:52,967 INFO L225 Difference]: With dead ends: 19620 [2025-03-16 15:04:52,967 INFO L226 Difference]: Without dead ends: 12983 [2025-03-16 15:04:52,975 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-16 15:04:52,976 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 909 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 2890 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 3429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 2890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:52,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 639 Invalid, 3429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 2890 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-16 15:04:52,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12983 states. [2025-03-16 15:04:53,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12983 to 12974. [2025-03-16 15:04:53,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12974 states, 12973 states have (on average 1.2721035997841672) internal successors, (16503), 12973 states have internal predecessors, (16503), 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-16 15:04:53,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12974 states to 12974 states and 16503 transitions. [2025-03-16 15:04:53,132 INFO L78 Accepts]: Start accepts. Automaton has 12974 states and 16503 transitions. Word has length 233 [2025-03-16 15:04:53,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:53,133 INFO L471 AbstractCegarLoop]: Abstraction has 12974 states and 16503 transitions. [2025-03-16 15:04:53,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 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-16 15:04:53,134 INFO L276 IsEmpty]: Start isEmpty. Operand 12974 states and 16503 transitions. [2025-03-16 15:04:53,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-16 15:04:53,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:53,136 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:04:53,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:04:53,136 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:53,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:53,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1093057290, now seen corresponding path program 1 times [2025-03-16 15:04:53,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:53,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302687409] [2025-03-16 15:04:53,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:53,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:53,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-16 15:04:53,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-16 15:04:53,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:53,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:53,349 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-16 15:04:53,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:53,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302687409] [2025-03-16 15:04:53,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302687409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:53,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:53,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:04:53,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119791686] [2025-03-16 15:04:53,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:53,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:53,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:53,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:53,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:04:53,352 INFO L87 Difference]: Start difference. First operand 12974 states and 16503 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:55,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:55,922 INFO L93 Difference]: Finished difference Result 36179 states and 46597 transitions. [2025-03-16 15:04:55,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:55,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 249 [2025-03-16 15:04:55,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:55,961 INFO L225 Difference]: With dead ends: 36179 [2025-03-16 15:04:55,961 INFO L226 Difference]: Without dead ends: 23993 [2025-03-16 15:04:55,969 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-16 15:04:55,971 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 857 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 869 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 3177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 869 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:55,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 983 Invalid, 3177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [869 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-16 15:04:55,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23993 states. [2025-03-16 15:04:56,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23993 to 23202. [2025-03-16 15:04:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23202 states, 23201 states have (on average 1.2067583293823543) internal successors, (27998), 23201 states have internal predecessors, (27998), 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-16 15:04:56,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23202 states to 23202 states and 27998 transitions. [2025-03-16 15:04:56,181 INFO L78 Accepts]: Start accepts. Automaton has 23202 states and 27998 transitions. Word has length 249 [2025-03-16 15:04:56,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:56,181 INFO L471 AbstractCegarLoop]: Abstraction has 23202 states and 27998 transitions. [2025-03-16 15:04:56,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:04:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 23202 states and 27998 transitions. [2025-03-16 15:04:56,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-16 15:04:56,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:56,187 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:04:56,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:04:56,187 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:56,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:56,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1491720498, now seen corresponding path program 1 times [2025-03-16 15:04:56,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:56,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668523046] [2025-03-16 15:04:56,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:56,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:56,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-16 15:04:56,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-16 15:04:56,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:56,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:56,315 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:04:56,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:56,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668523046] [2025-03-16 15:04:56,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668523046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:56,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:56,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:04:56,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148489359] [2025-03-16 15:04:56,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:56,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:04:56,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:56,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:04:56,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:04:56,317 INFO L87 Difference]: Start difference. First operand 23202 states and 27998 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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-16 15:04:59,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:04:59,028 INFO L93 Difference]: Finished difference Result 57431 states and 70772 transitions. [2025-03-16 15:04:59,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:04:59,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 251 [2025-03-16 15:04:59,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:04:59,101 INFO L225 Difference]: With dead ends: 57431 [2025-03-16 15:04:59,103 INFO L226 Difference]: Without dead ends: 35017 [2025-03-16 15:04:59,123 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-16 15:04:59,126 INFO L435 NwaCegarLoop]: 805 mSDtfsCounter, 857 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 914 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 3295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 914 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:04:59,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 922 Invalid, 3295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [914 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 15:04:59,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35017 states. [2025-03-16 15:04:59,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35017 to 33433. [2025-03-16 15:04:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33433 states, 33432 states have (on average 1.1907154821727686) internal successors, (39808), 33432 states have internal predecessors, (39808), 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-16 15:04:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33433 states to 33433 states and 39808 transitions. [2025-03-16 15:04:59,469 INFO L78 Accepts]: Start accepts. Automaton has 33433 states and 39808 transitions. Word has length 251 [2025-03-16 15:04:59,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:04:59,469 INFO L471 AbstractCegarLoop]: Abstraction has 33433 states and 39808 transitions. [2025-03-16 15:04:59,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 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-16 15:04:59,470 INFO L276 IsEmpty]: Start isEmpty. Operand 33433 states and 39808 transitions. [2025-03-16 15:04:59,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-03-16 15:04:59,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:04:59,474 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:04:59,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:04:59,475 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:04:59,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:04:59,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1972560161, now seen corresponding path program 1 times [2025-03-16 15:04:59,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:04:59,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553654219] [2025-03-16 15:04:59,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:04:59,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:04:59,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-03-16 15:04:59,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-03-16 15:04:59,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:04:59,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:04:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-16 15:04:59,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:04:59,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553654219] [2025-03-16 15:04:59,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553654219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:04:59,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:04:59,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:04:59,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848776220] [2025-03-16 15:04:59,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:04:59,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:04:59,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:04:59,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:04:59,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:04:59,733 INFO L87 Difference]: Start difference. First operand 33433 states and 39808 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 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-16 15:05:05,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:05,209 INFO L93 Difference]: Finished difference Result 117461 states and 141050 transitions. [2025-03-16 15:05:05,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:05:05,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 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 340 [2025-03-16 15:05:05,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:05,321 INFO L225 Difference]: With dead ends: 117461 [2025-03-16 15:05:05,321 INFO L226 Difference]: Without dead ends: 84816 [2025-03-16 15:05:05,362 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-16 15:05:05,363 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 1727 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 6676 mSolverCounterSat, 1117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1727 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 7793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1117 IncrementalHoareTripleChecker+Valid, 6676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:05,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1727 Valid, 746 Invalid, 7793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1117 Valid, 6676 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-03-16 15:05:05,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84816 states. [2025-03-16 15:05:06,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84816 to 83899. [2025-03-16 15:05:06,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83899 states, 83898 states have (on average 1.1736275000595962) internal successors, (98465), 83898 states have internal predecessors, (98465), 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-16 15:05:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83899 states to 83899 states and 98465 transitions. [2025-03-16 15:05:06,230 INFO L78 Accepts]: Start accepts. Automaton has 83899 states and 98465 transitions. Word has length 340 [2025-03-16 15:05:06,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:06,230 INFO L471 AbstractCegarLoop]: Abstraction has 83899 states and 98465 transitions. [2025-03-16 15:05:06,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 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-16 15:05:06,230 INFO L276 IsEmpty]: Start isEmpty. Operand 83899 states and 98465 transitions. [2025-03-16 15:05:06,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-03-16 15:05:06,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:06,236 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 15:05:06,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:05:06,236 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:06,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:06,236 INFO L85 PathProgramCache]: Analyzing trace with hash 729906323, now seen corresponding path program 1 times [2025-03-16 15:05:06,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:06,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404830678] [2025-03-16 15:05:06,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:06,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:06,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-16 15:05:06,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-16 15:05:06,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:06,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:06,453 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-16 15:05:06,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:06,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404830678] [2025-03-16 15:05:06,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404830678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:06,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:06,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:06,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617010174] [2025-03-16 15:05:06,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:06,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:06,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:06,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:06,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:06,456 INFO L87 Difference]: Start difference. First operand 83899 states and 98465 transitions. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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-16 15:05:09,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:09,080 INFO L93 Difference]: Finished difference Result 167045 states and 196194 transitions. [2025-03-16 15:05:09,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:09,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 349 [2025-03-16 15:05:09,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:09,170 INFO L225 Difference]: With dead ends: 167045 [2025-03-16 15:05:09,170 INFO L226 Difference]: Without dead ends: 83934 [2025-03-16 15:05:09,212 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-16 15:05:09,212 INFO L435 NwaCegarLoop]: 1850 mSDtfsCounter, 753 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 2597 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1991 SdHoareTripleChecker+Invalid, 2907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 2597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:09,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1991 Invalid, 2907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 2597 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:05:09,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83934 states. [2025-03-16 15:05:09,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83934 to 83900. [2025-03-16 15:05:10,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83900 states, 83899 states have (on average 1.1574750592974887) internal successors, (97111), 83899 states have internal predecessors, (97111), 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-16 15:05:10,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83900 states to 83900 states and 97111 transitions. [2025-03-16 15:05:10,136 INFO L78 Accepts]: Start accepts. Automaton has 83900 states and 97111 transitions. Word has length 349 [2025-03-16 15:05:10,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:10,137 INFO L471 AbstractCegarLoop]: Abstraction has 83900 states and 97111 transitions. [2025-03-16 15:05:10,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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-16 15:05:10,137 INFO L276 IsEmpty]: Start isEmpty. Operand 83900 states and 97111 transitions. [2025-03-16 15:05:10,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-03-16 15:05:10,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:10,144 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 15:05:10,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:05:10,145 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:10,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:10,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1199275902, now seen corresponding path program 1 times [2025-03-16 15:05:10,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:10,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733665688] [2025-03-16 15:05:10,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:10,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:10,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-16 15:05:10,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-16 15:05:10,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:10,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:10,309 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 380 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-16 15:05:10,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:10,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733665688] [2025-03-16 15:05:10,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733665688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:10,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:10,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:10,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404624354] [2025-03-16 15:05:10,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:10,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:10,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:10,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:10,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:10,311 INFO L87 Difference]: Start difference. First operand 83900 states and 97111 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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-16 15:05:12,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:12,940 INFO L93 Difference]: Finished difference Result 171709 states and 198021 transitions. [2025-03-16 15:05:12,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:12,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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 369 [2025-03-16 15:05:12,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:13,042 INFO L225 Difference]: With dead ends: 171709 [2025-03-16 15:05:13,042 INFO L226 Difference]: Without dead ends: 85444 [2025-03-16 15:05:13,094 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-16 15:05:13,094 INFO L435 NwaCegarLoop]: 1511 mSDtfsCounter, 1037 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 2943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:13,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1646 Invalid, 2943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 15:05:13,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85444 states. [2025-03-16 15:05:13,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85444 to 80708. [2025-03-16 15:05:14,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80708 states, 80707 states have (on average 1.104774059251366) internal successors, (89163), 80707 states have internal predecessors, (89163), 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-16 15:05:14,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80708 states to 80708 states and 89163 transitions. [2025-03-16 15:05:14,115 INFO L78 Accepts]: Start accepts. Automaton has 80708 states and 89163 transitions. Word has length 369 [2025-03-16 15:05:14,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:14,115 INFO L471 AbstractCegarLoop]: Abstraction has 80708 states and 89163 transitions. [2025-03-16 15:05:14,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 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-16 15:05:14,116 INFO L276 IsEmpty]: Start isEmpty. Operand 80708 states and 89163 transitions. [2025-03-16 15:05:14,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2025-03-16 15:05:14,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:14,121 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 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] [2025-03-16 15:05:14,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:05:14,121 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:14,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:14,122 INFO L85 PathProgramCache]: Analyzing trace with hash -743246772, now seen corresponding path program 1 times [2025-03-16 15:05:14,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:14,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623611401] [2025-03-16 15:05:14,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:14,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:14,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-16 15:05:14,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-16 15:05:14,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:14,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:15,078 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 270 proven. 113 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-16 15:05:15,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:15,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623611401] [2025-03-16 15:05:15,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623611401] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:05:15,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162829] [2025-03-16 15:05:15,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:15,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:05:15,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:05:15,081 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-16 15:05:15,083 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-16 15:05:15,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 378 statements into 1 equivalence classes. [2025-03-16 15:05:15,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 378 of 378 statements. [2025-03-16 15:05:15,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:15,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:15,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:05:15,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:05:15,326 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2025-03-16 15:05:15,326 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:05:15,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:15,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:05:15,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-16 15:05:15,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003302882] [2025-03-16 15:05:15,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:15,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:15,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:15,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:15,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:05:15,328 INFO L87 Difference]: Start difference. First operand 80708 states and 89163 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-16 15:05:17,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:17,831 INFO L93 Difference]: Finished difference Result 160626 states and 177532 transitions. [2025-03-16 15:05:17,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:17,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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 378 [2025-03-16 15:05:17,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:17,928 INFO L225 Difference]: With dead ends: 160626 [2025-03-16 15:05:17,928 INFO L226 Difference]: Without dead ends: 80706 [2025-03-16 15:05:17,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 377 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:05:17,982 INFO L435 NwaCegarLoop]: 1343 mSDtfsCounter, 1113 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1421 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:17,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1421 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-16 15:05:18,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80706 states. [2025-03-16 15:05:18,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80706 to 80705. [2025-03-16 15:05:18,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80705 states, 80704 states have (on average 1.079611915146709) internal successors, (87129), 80704 states have internal predecessors, (87129), 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-16 15:05:18,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80705 states to 80705 states and 87129 transitions. [2025-03-16 15:05:18,804 INFO L78 Accepts]: Start accepts. Automaton has 80705 states and 87129 transitions. Word has length 378 [2025-03-16 15:05:18,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:18,805 INFO L471 AbstractCegarLoop]: Abstraction has 80705 states and 87129 transitions. [2025-03-16 15:05:18,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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-16 15:05:18,805 INFO L276 IsEmpty]: Start isEmpty. Operand 80705 states and 87129 transitions. [2025-03-16 15:05:18,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-03-16 15:05:18,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:18,809 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:18,816 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-16 15:05:19,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-16 15:05:19,010 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:19,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:19,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1336350014, now seen corresponding path program 1 times [2025-03-16 15:05:19,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:19,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737054708] [2025-03-16 15:05:19,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:19,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:19,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-03-16 15:05:19,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-03-16 15:05:19,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:19,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:19,307 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 532 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-16 15:05:19,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:19,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737054708] [2025-03-16 15:05:19,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737054708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:19,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:19,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:19,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768548029] [2025-03-16 15:05:19,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:19,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:19,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:19,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:19,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:19,309 INFO L87 Difference]: Start difference. First operand 80705 states and 87129 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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-16 15:05:22,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:22,242 INFO L93 Difference]: Finished difference Result 187387 states and 204117 transitions. [2025-03-16 15:05:22,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:22,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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 408 [2025-03-16 15:05:22,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:22,375 INFO L225 Difference]: With dead ends: 187387 [2025-03-16 15:05:22,375 INFO L226 Difference]: Without dead ends: 107470 [2025-03-16 15:05:22,418 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-16 15:05:22,418 INFO L435 NwaCegarLoop]: 821 mSDtfsCounter, 873 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 3338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 2418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:22,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 904 Invalid, 3338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 2418 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:05:22,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107470 states. [2025-03-16 15:05:23,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107470 to 105090. [2025-03-16 15:05:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105090 states, 105089 states have (on average 1.0853467061252844) internal successors, (114058), 105089 states have internal predecessors, (114058), 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-16 15:05:23,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105090 states to 105090 states and 114058 transitions. [2025-03-16 15:05:23,510 INFO L78 Accepts]: Start accepts. Automaton has 105090 states and 114058 transitions. Word has length 408 [2025-03-16 15:05:23,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:23,510 INFO L471 AbstractCegarLoop]: Abstraction has 105090 states and 114058 transitions. [2025-03-16 15:05:23,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 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-16 15:05:23,511 INFO L276 IsEmpty]: Start isEmpty. Operand 105090 states and 114058 transitions. [2025-03-16 15:05:23,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-03-16 15:05:23,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:23,516 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:05:23,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:05:23,517 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:23,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:23,517 INFO L85 PathProgramCache]: Analyzing trace with hash -242495668, now seen corresponding path program 1 times [2025-03-16 15:05:23,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:23,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660801890] [2025-03-16 15:05:23,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:23,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:23,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-16 15:05:23,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-16 15:05:23,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:23,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:23,941 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-16 15:05:23,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:23,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660801890] [2025-03-16 15:05:23,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660801890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:23,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:23,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:23,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128097545] [2025-03-16 15:05:23,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:23,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:23,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:23,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:23,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:23,944 INFO L87 Difference]: Start difference. First operand 105090 states and 114058 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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-16 15:05:27,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:27,148 INFO L93 Difference]: Finished difference Result 236165 states and 257968 transitions. [2025-03-16 15:05:27,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:27,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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 446 [2025-03-16 15:05:27,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:27,307 INFO L225 Difference]: With dead ends: 236165 [2025-03-16 15:05:27,307 INFO L226 Difference]: Without dead ends: 129502 [2025-03-16 15:05:27,352 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-16 15:05:27,353 INFO L435 NwaCegarLoop]: 1740 mSDtfsCounter, 785 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 3232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:27,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1882 Invalid, 3232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:05:27,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129502 states. [2025-03-16 15:05:28,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129502 to 127912. [2025-03-16 15:05:28,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127912 states, 127911 states have (on average 1.0750756385299154) internal successors, (137514), 127911 states have internal predecessors, (137514), 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-16 15:05:28,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127912 states to 127912 states and 137514 transitions. [2025-03-16 15:05:28,954 INFO L78 Accepts]: Start accepts. Automaton has 127912 states and 137514 transitions. Word has length 446 [2025-03-16 15:05:28,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:28,955 INFO L471 AbstractCegarLoop]: Abstraction has 127912 states and 137514 transitions. [2025-03-16 15:05:28,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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-16 15:05:28,955 INFO L276 IsEmpty]: Start isEmpty. Operand 127912 states and 137514 transitions. [2025-03-16 15:05:28,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2025-03-16 15:05:28,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:28,966 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, 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, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:05:28,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:05:28,966 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:28,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:28,966 INFO L85 PathProgramCache]: Analyzing trace with hash 2081268943, now seen corresponding path program 1 times [2025-03-16 15:05:28,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:28,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397288346] [2025-03-16 15:05:28,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:28,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:28,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 517 statements into 1 equivalence classes. [2025-03-16 15:05:29,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 517 of 517 statements. [2025-03-16 15:05:29,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:29,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 869 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2025-03-16 15:05:29,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:29,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397288346] [2025-03-16 15:05:29,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397288346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:29,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:29,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:29,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291725537] [2025-03-16 15:05:29,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:29,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:29,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:29,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:29,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:29,234 INFO L87 Difference]: Start difference. First operand 127912 states and 137514 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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-16 15:05:31,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:31,873 INFO L93 Difference]: Finished difference Result 256614 states and 275825 transitions. [2025-03-16 15:05:31,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:31,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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 517 [2025-03-16 15:05:31,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:32,028 INFO L225 Difference]: With dead ends: 256614 [2025-03-16 15:05:32,028 INFO L226 Difference]: Without dead ends: 129490 [2025-03-16 15:05:32,085 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-16 15:05:32,085 INFO L435 NwaCegarLoop]: 1375 mSDtfsCounter, 936 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2474 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 3067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 2474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:32,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1457 Invalid, 3067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 2474 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 15:05:32,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129490 states. [2025-03-16 15:05:33,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129490 to 127903. [2025-03-16 15:05:33,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127903 states, 127902 states have (on average 1.056074181795437) internal successors, (135074), 127902 states have internal predecessors, (135074), 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-16 15:05:33,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127903 states to 127903 states and 135074 transitions. [2025-03-16 15:05:33,474 INFO L78 Accepts]: Start accepts. Automaton has 127903 states and 135074 transitions. Word has length 517 [2025-03-16 15:05:33,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:33,475 INFO L471 AbstractCegarLoop]: Abstraction has 127903 states and 135074 transitions. [2025-03-16 15:05:33,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 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-16 15:05:33,475 INFO L276 IsEmpty]: Start isEmpty. Operand 127903 states and 135074 transitions. [2025-03-16 15:05:33,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-03-16 15:05:33,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:33,491 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2025-03-16 15:05:33,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:05:33,491 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:33,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:33,492 INFO L85 PathProgramCache]: Analyzing trace with hash -688241655, now seen corresponding path program 1 times [2025-03-16 15:05:33,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:33,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639401978] [2025-03-16 15:05:33,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:33,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:33,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-03-16 15:05:33,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-03-16 15:05:33,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:33,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:33,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 753 proven. 0 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2025-03-16 15:05:33,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:33,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639401978] [2025-03-16 15:05:33,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639401978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:33,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:33,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:33,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483381099] [2025-03-16 15:05:33,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:33,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:33,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:33,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:33,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:33,992 INFO L87 Difference]: Start difference. First operand 127903 states and 135074 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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-16 15:05:36,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:36,392 INFO L93 Difference]: Finished difference Result 240065 states and 254012 transitions. [2025-03-16 15:05:36,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:36,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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 528 [2025-03-16 15:05:36,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:36,523 INFO L225 Difference]: With dead ends: 240065 [2025-03-16 15:05:36,523 INFO L226 Difference]: Without dead ends: 128696 [2025-03-16 15:05:36,573 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-16 15:05:36,573 INFO L435 NwaCegarLoop]: 1786 mSDtfsCounter, 722 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 2526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:36,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1919 Invalid, 2526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 15:05:36,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128696 states. [2025-03-16 15:05:37,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128696 to 128691. [2025-03-16 15:05:37,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128691 states, 128690 states have (on average 1.0560338798663456) internal successors, (135901), 128690 states have internal predecessors, (135901), 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-16 15:05:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128691 states to 128691 states and 135901 transitions. [2025-03-16 15:05:37,930 INFO L78 Accepts]: Start accepts. Automaton has 128691 states and 135901 transitions. Word has length 528 [2025-03-16 15:05:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:37,931 INFO L471 AbstractCegarLoop]: Abstraction has 128691 states and 135901 transitions. [2025-03-16 15:05:37,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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-16 15:05:37,931 INFO L276 IsEmpty]: Start isEmpty. Operand 128691 states and 135901 transitions. [2025-03-16 15:05:37,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2025-03-16 15:05:37,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:37,950 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, 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, 3, 3, 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] [2025-03-16 15:05:37,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:05:37,950 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:37,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:37,950 INFO L85 PathProgramCache]: Analyzing trace with hash -355536223, now seen corresponding path program 1 times [2025-03-16 15:05:37,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:37,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076581622] [2025-03-16 15:05:37,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:37,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:37,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 558 statements into 1 equivalence classes. [2025-03-16 15:05:38,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 558 of 558 statements. [2025-03-16 15:05:38,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:38,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:38,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1147 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2025-03-16 15:05:38,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:38,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076581622] [2025-03-16 15:05:38,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076581622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:38,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:38,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:38,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553378408] [2025-03-16 15:05:38,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:38,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:38,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:38,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:38,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:38,471 INFO L87 Difference]: Start difference. First operand 128691 states and 135901 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-16 15:05:41,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:41,812 INFO L93 Difference]: Finished difference Result 305519 states and 322791 transitions. [2025-03-16 15:05:41,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:41,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 558 [2025-03-16 15:05:41,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:42,013 INFO L225 Difference]: With dead ends: 305519 [2025-03-16 15:05:42,014 INFO L226 Difference]: Without dead ends: 177616 [2025-03-16 15:05:42,099 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-16 15:05:42,100 INFO L435 NwaCegarLoop]: 1754 mSDtfsCounter, 883 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 3291 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 3628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 3291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:42,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 1877 Invalid, 3628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 3291 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-16 15:05:42,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177616 states. [2025-03-16 15:05:43,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177616 to 175157. [2025-03-16 15:05:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175157 states, 175156 states have (on average 1.0544771517961131) internal successors, (184698), 175156 states have internal predecessors, (184698), 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-16 15:05:44,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175157 states to 175157 states and 184698 transitions. [2025-03-16 15:05:44,049 INFO L78 Accepts]: Start accepts. Automaton has 175157 states and 184698 transitions. Word has length 558 [2025-03-16 15:05:44,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:44,049 INFO L471 AbstractCegarLoop]: Abstraction has 175157 states and 184698 transitions. [2025-03-16 15:05:44,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-16 15:05:44,049 INFO L276 IsEmpty]: Start isEmpty. Operand 175157 states and 184698 transitions. [2025-03-16 15:05:44,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2025-03-16 15:05:44,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:44,075 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:05:44,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:05:44,075 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:44,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:44,075 INFO L85 PathProgramCache]: Analyzing trace with hash -460713271, now seen corresponding path program 1 times [2025-03-16 15:05:44,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:44,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343042102] [2025-03-16 15:05:44,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:44,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:44,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes. [2025-03-16 15:05:44,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements. [2025-03-16 15:05:44,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:44,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:44,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1489 backedges. 732 proven. 0 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2025-03-16 15:05:44,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:44,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343042102] [2025-03-16 15:05:44,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343042102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:44,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:44,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:44,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085104123] [2025-03-16 15:05:44,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:44,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:05:44,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:44,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:05:44,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:05:44,688 INFO L87 Difference]: Start difference. First operand 175157 states and 184698 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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-16 15:05:47,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:05:47,640 INFO L93 Difference]: Finished difference Result 345599 states and 365069 transitions. [2025-03-16 15:05:47,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:05:47,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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 606 [2025-03-16 15:05:47,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:05:47,833 INFO L225 Difference]: With dead ends: 345599 [2025-03-16 15:05:47,833 INFO L226 Difference]: Without dead ends: 189337 [2025-03-16 15:05:47,900 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-16 15:05:47,900 INFO L435 NwaCegarLoop]: 1788 mSDtfsCounter, 699 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 2586 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 2742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 2586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:05:47,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 1958 Invalid, 2742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 2586 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-16 15:05:48,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189337 states. [2025-03-16 15:05:49,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189337 to 189325. [2025-03-16 15:05:49,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189325 states, 189324 states have (on average 1.0524603325516046) internal successors, (199256), 189324 states have internal predecessors, (199256), 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-16 15:05:49,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189325 states to 189325 states and 199256 transitions. [2025-03-16 15:05:49,743 INFO L78 Accepts]: Start accepts. Automaton has 189325 states and 199256 transitions. Word has length 606 [2025-03-16 15:05:49,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:05:49,743 INFO L471 AbstractCegarLoop]: Abstraction has 189325 states and 199256 transitions. [2025-03-16 15:05:49,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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-16 15:05:49,743 INFO L276 IsEmpty]: Start isEmpty. Operand 189325 states and 199256 transitions. [2025-03-16 15:05:49,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2025-03-16 15:05:49,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:05:49,759 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 15:05:49,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:05:49,759 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:05:49,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:05:49,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1753341427, now seen corresponding path program 1 times [2025-03-16 15:05:49,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:05:49,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339740950] [2025-03-16 15:05:49,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:05:49,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:05:50,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 613 statements into 1 equivalence classes. [2025-03-16 15:05:50,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 613 of 613 statements. [2025-03-16 15:05:50,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:05:50,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:05:50,599 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 523 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-16 15:05:50,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:05:50,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339740950] [2025-03-16 15:05:50,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339740950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:05:50,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:05:50,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:05:50,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108318848] [2025-03-16 15:05:50,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:05:50,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:05:50,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:05:50,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:05:50,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:05:50,604 INFO L87 Difference]: Start difference. First operand 189325 states and 199256 transitions. Second operand has 4 states, 4 states have (on average 140.75) internal successors, (563), 3 states have internal predecessors, (563), 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)