./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem04_label34.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem04_label34.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6000afea4dd0404b9ff958778867dfa6300a2acabdbe98e6a467db1851bf3ceb --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:52:33,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:52:33,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:52:33,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:52:33,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:52:33,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:52:33,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:52:33,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:52:33,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:52:33,965 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:52:33,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:52:33,965 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:52:33,965 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:52:33,965 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:52:33,965 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:52:33,965 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:52:33,965 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:52:33,965 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:52:33,965 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:52:33,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:52:33,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:52:33,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:52:33,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:52:33,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:52:33,966 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:52:33,966 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:52:33,966 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:52:33,966 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:52:33,966 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:52:33,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:52:33,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:52:33,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:52:33,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:52:33,966 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:52:33,966 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:52:33,966 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:52:33,966 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:52:33,966 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:52:33,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:52:33,966 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:52:33,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:52:33,967 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:52:33,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:52:33,967 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6000afea4dd0404b9ff958778867dfa6300a2acabdbe98e6a467db1851bf3ceb [2025-02-05 10:52:34,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:52:34,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:52:34,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:52:34,150 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:52:34,150 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:52:34,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem04_label34.c [2025-02-05 10:52:35,254 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c4c2e717/31a1dd79fb2946aeab2f22cafe075d06/FLAG741ade687 [2025-02-05 10:52:35,752 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:52:35,753 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem04_label34.c [2025-02-05 10:52:35,781 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c4c2e717/31a1dd79fb2946aeab2f22cafe075d06/FLAG741ade687 [2025-02-05 10:52:35,795 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c4c2e717/31a1dd79fb2946aeab2f22cafe075d06 [2025-02-05 10:52:35,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:52:35,798 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:52:35,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:52:35,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:52:35,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:52:35,807 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:52:35" (1/1) ... [2025-02-05 10:52:35,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fbc0b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:35, skipping insertion in model container [2025-02-05 10:52:35,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:52:35" (1/1) ... [2025-02-05 10:52:35,893 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:52:36,549 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem04_label34.c[180736,180749] [2025-02-05 10:52:36,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:52:36,574 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:52:36,849 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem04_label34.c[180736,180749] [2025-02-05 10:52:36,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:52:36,871 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:52:36,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:36 WrapperNode [2025-02-05 10:52:36,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:52:36,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:52:36,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:52:36,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:52:36,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:36" (1/1) ... [2025-02-05 10:52:36,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:36" (1/1) ... [2025-02-05 10:52:37,085 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5573 [2025-02-05 10:52:37,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:52:37,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:52:37,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:52:37,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:52:37,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:36" (1/1) ... [2025-02-05 10:52:37,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:36" (1/1) ... [2025-02-05 10:52:37,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:36" (1/1) ... [2025-02-05 10:52:37,168 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-02-05 10:52:37,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:36" (1/1) ... [2025-02-05 10:52:37,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:36" (1/1) ... [2025-02-05 10:52:37,286 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:36" (1/1) ... [2025-02-05 10:52:37,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:36" (1/1) ... [2025-02-05 10:52:37,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:36" (1/1) ... [2025-02-05 10:52:37,320 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:36" (1/1) ... [2025-02-05 10:52:37,343 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:52:37,348 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:52:37,349 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:52:37,349 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:52:37,350 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:36" (1/1) ... [2025-02-05 10:52:37,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:52:37,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:52:37,390 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 10:52:37,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 10:52:37,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:52:37,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:52:37,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:52:37,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:52:37,498 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:52:37,499 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:52:40,688 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4081: havoc calculate_output3_#t~ret11#1; [2025-02-05 10:52:40,689 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1382: havoc calculate_output_#t~ret9#1; [2025-02-05 10:52:40,689 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2719: havoc calculate_output2_#t~ret10#1; [2025-02-05 10:52:40,808 INFO L? ?]: Removed 768 outVars from TransFormulas that were not future-live. [2025-02-05 10:52:40,809 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:52:40,842 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:52:40,843 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:52:40,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:52:40 BoogieIcfgContainer [2025-02-05 10:52:40,843 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:52:40,845 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:52:40,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:52:40,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:52:40,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:52:35" (1/3) ... [2025-02-05 10:52:40,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e3ae90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:52:40, skipping insertion in model container [2025-02-05 10:52:40,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:36" (2/3) ... [2025-02-05 10:52:40,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e3ae90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:52:40, skipping insertion in model container [2025-02-05 10:52:40,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:52:40" (3/3) ... [2025-02-05 10:52:40,850 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem04_label34.c [2025-02-05 10:52:40,860 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:52:40,861 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem04_label34.c that has 1 procedures, 885 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 10:52:40,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:52:40,931 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;@302c0d9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:52:40,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:52:40,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 885 states, 883 states have (on average 1.9218573046432617) internal successors, (1697), 884 states have internal predecessors, (1697), 0 states have call successors, (0), 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-02-05 10:52:40,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 789 [2025-02-05 10:52:40,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:52:40,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:52:40,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:52:40,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:52:40,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1482932053, now seen corresponding path program 1 times [2025-02-05 10:52:40,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:52:40,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372514501] [2025-02-05 10:52:40,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:52:41,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:52:41,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 788 statements into 1 equivalence classes. [2025-02-05 10:52:41,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 788 of 788 statements. [2025-02-05 10:52:41,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:52:41,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:52:42,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:52:42,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:52:42,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372514501] [2025-02-05 10:52:42,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372514501] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:52:42,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:52:42,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:52:42,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230248162] [2025-02-05 10:52:42,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:52:42,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:52:42,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:52:42,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:52:42,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:52:42,615 INFO L87 Difference]: Start difference. First operand has 885 states, 883 states have (on average 1.9218573046432617) internal successors, (1697), 884 states have internal predecessors, (1697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 262.6666666666667) internal successors, (788), 2 states have internal predecessors, (788), 0 states have call successors, (0), 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-02-05 10:52:45,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:52:45,429 INFO L93 Difference]: Finished difference Result 2589 states and 5025 transitions. [2025-02-05 10:52:45,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:52:45,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 262.6666666666667) internal successors, (788), 2 states have internal predecessors, (788), 0 states have call successors, (0), 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 788 [2025-02-05 10:52:45,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:52:45,445 INFO L225 Difference]: With dead ends: 2589 [2025-02-05 10:52:45,446 INFO L226 Difference]: Without dead ends: 1640 [2025-02-05 10:52:45,449 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-02-05 10:52:45,451 INFO L435 NwaCegarLoop]: 505 mSDtfsCounter, 263 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 1137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1137 IncrementalHoareTripleChecker+Valid, 2140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:52:45,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 516 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1137 Valid, 2140 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 10:52:45,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2025-02-05 10:52:45,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2025-02-05 10:52:45,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1639 states have (on average 1.6375838926174497) internal successors, (2684), 1639 states have internal predecessors, (2684), 0 states have call successors, (0), 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-02-05 10:52:45,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 2684 transitions. [2025-02-05 10:52:45,524 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 2684 transitions. Word has length 788 [2025-02-05 10:52:45,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:52:45,525 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 2684 transitions. [2025-02-05 10:52:45,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.6666666666667) internal successors, (788), 2 states have internal predecessors, (788), 0 states have call successors, (0), 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-02-05 10:52:45,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2684 transitions. [2025-02-05 10:52:45,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 800 [2025-02-05 10:52:45,537 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:52:45,537 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:52:45,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:52:45,538 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:52:45,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:52:45,539 INFO L85 PathProgramCache]: Analyzing trace with hash 435769262, now seen corresponding path program 1 times [2025-02-05 10:52:45,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:52:45,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737304991] [2025-02-05 10:52:45,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:52:45,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:52:45,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 799 statements into 1 equivalence classes. [2025-02-05 10:52:45,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 799 of 799 statements. [2025-02-05 10:52:45,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:52:45,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:52:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:52:46,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:52:46,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737304991] [2025-02-05 10:52:46,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737304991] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:52:46,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:52:46,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:52:46,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859303345] [2025-02-05 10:52:46,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:52:46,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:52:46,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:52:46,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:52:46,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:52:46,119 INFO L87 Difference]: Start difference. First operand 1640 states and 2684 transitions. Second operand has 3 states, 3 states have (on average 266.3333333333333) internal successors, (799), 2 states have internal predecessors, (799), 0 states have call successors, (0), 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-02-05 10:52:48,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:52:48,854 INFO L93 Difference]: Finished difference Result 4914 states and 8047 transitions. [2025-02-05 10:52:48,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:52:48,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 266.3333333333333) internal successors, (799), 2 states have internal predecessors, (799), 0 states have call successors, (0), 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 799 [2025-02-05 10:52:48,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:52:48,864 INFO L225 Difference]: With dead ends: 4914 [2025-02-05 10:52:48,865 INFO L226 Difference]: Without dead ends: 3276 [2025-02-05 10:52:48,867 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-02-05 10:52:48,868 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 987 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2272 mSolverCounterSat, 1115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 3387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1115 IncrementalHoareTripleChecker+Valid, 2272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:52:48,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 243 Invalid, 3387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1115 Valid, 2272 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 10:52:48,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2025-02-05 10:52:48,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 3276. [2025-02-05 10:52:48,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3276 states, 3275 states have (on average 1.540763358778626) internal successors, (5046), 3275 states have internal predecessors, (5046), 0 states have call successors, (0), 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-02-05 10:52:48,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 3276 states and 5046 transitions. [2025-02-05 10:52:48,914 INFO L78 Accepts]: Start accepts. Automaton has 3276 states and 5046 transitions. Word has length 799 [2025-02-05 10:52:48,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:52:48,914 INFO L471 AbstractCegarLoop]: Abstraction has 3276 states and 5046 transitions. [2025-02-05 10:52:48,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.3333333333333) internal successors, (799), 2 states have internal predecessors, (799), 0 states have call successors, (0), 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-02-05 10:52:48,914 INFO L276 IsEmpty]: Start isEmpty. Operand 3276 states and 5046 transitions. [2025-02-05 10:52:48,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 838 [2025-02-05 10:52:48,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:52:48,922 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:52:48,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:52:48,923 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:52:48,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:52:48,924 INFO L85 PathProgramCache]: Analyzing trace with hash 705950365, now seen corresponding path program 1 times [2025-02-05 10:52:48,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:52:48,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16881024] [2025-02-05 10:52:48,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:52:48,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:52:48,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 837 statements into 1 equivalence classes. [2025-02-05 10:52:49,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 837 of 837 statements. [2025-02-05 10:52:49,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:52:49,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:52:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 10:52:49,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:52:49,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16881024] [2025-02-05 10:52:49,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16881024] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:52:49,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:52:49,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:52:49,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136650065] [2025-02-05 10:52:49,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:52:49,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:52:49,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:52:49,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:52:49,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:52:49,603 INFO L87 Difference]: Start difference. First operand 3276 states and 5046 transitions. Second operand has 3 states, 3 states have (on average 271.0) internal successors, (813), 2 states have internal predecessors, (813), 0 states have call successors, (0), 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-02-05 10:52:52,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:52:52,098 INFO L93 Difference]: Finished difference Result 9822 states and 15133 transitions. [2025-02-05 10:52:52,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:52:52,099 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 271.0) internal successors, (813), 2 states have internal predecessors, (813), 0 states have call successors, (0), 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 837 [2025-02-05 10:52:52,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:52:52,117 INFO L225 Difference]: With dead ends: 9822 [2025-02-05 10:52:52,118 INFO L226 Difference]: Without dead ends: 6548 [2025-02-05 10:52:52,120 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-02-05 10:52:52,122 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 976 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2279 mSolverCounterSat, 1177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 3456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1177 IncrementalHoareTripleChecker+Valid, 2279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:52:52,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 200 Invalid, 3456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1177 Valid, 2279 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-05 10:52:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6548 states. [2025-02-05 10:52:52,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6548 to 6548. [2025-02-05 10:52:52,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6548 states, 6547 states have (on average 1.4776233389338629) internal successors, (9674), 6547 states have internal predecessors, (9674), 0 states have call successors, (0), 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-02-05 10:52:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6548 states to 6548 states and 9674 transitions. [2025-02-05 10:52:52,200 INFO L78 Accepts]: Start accepts. Automaton has 6548 states and 9674 transitions. Word has length 837 [2025-02-05 10:52:52,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:52:52,200 INFO L471 AbstractCegarLoop]: Abstraction has 6548 states and 9674 transitions. [2025-02-05 10:52:52,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 271.0) internal successors, (813), 2 states have internal predecessors, (813), 0 states have call successors, (0), 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-02-05 10:52:52,201 INFO L276 IsEmpty]: Start isEmpty. Operand 6548 states and 9674 transitions. [2025-02-05 10:52:52,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 893 [2025-02-05 10:52:52,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:52:52,213 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:52:52,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:52:52,214 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:52:52,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:52:52,215 INFO L85 PathProgramCache]: Analyzing trace with hash -637633374, now seen corresponding path program 1 times [2025-02-05 10:52:52,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:52:52,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379312391] [2025-02-05 10:52:52,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:52:52,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:52:52,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 892 statements into 1 equivalence classes. [2025-02-05 10:52:52,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 892 of 892 statements. [2025-02-05 10:52:52,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:52:52,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:52:52,640 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-05 10:52:52,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:52:52,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379312391] [2025-02-05 10:52:52,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379312391] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:52:52,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:52:52,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:52:52,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763237174] [2025-02-05 10:52:52,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:52:52,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:52:52,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:52:52,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:52:52,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:52:52,645 INFO L87 Difference]: Start difference. First operand 6548 states and 9674 transitions. Second operand has 3 states, 3 states have (on average 283.0) internal successors, (849), 2 states have internal predecessors, (849), 0 states have call successors, (0), 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-02-05 10:52:54,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:52:54,973 INFO L93 Difference]: Finished difference Result 19638 states and 29017 transitions. [2025-02-05 10:52:54,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:52:54,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 283.0) internal successors, (849), 2 states have internal predecessors, (849), 0 states have call successors, (0), 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 892 [2025-02-05 10:52:54,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:52:55,020 INFO L225 Difference]: With dead ends: 19638 [2025-02-05 10:52:55,020 INFO L226 Difference]: Without dead ends: 13092 [2025-02-05 10:52:55,034 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-02-05 10:52:55,035 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 842 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2923 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 3289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 2923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:52:55,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 375 Invalid, 3289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 2923 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 10:52:55,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13092 states. [2025-02-05 10:52:55,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13092 to 13092. [2025-02-05 10:52:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13092 states, 13091 states have (on average 1.4263234283095256) internal successors, (18672), 13091 states have internal predecessors, (18672), 0 states have call successors, (0), 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-02-05 10:52:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13092 states to 13092 states and 18672 transitions. [2025-02-05 10:52:55,181 INFO L78 Accepts]: Start accepts. Automaton has 13092 states and 18672 transitions. Word has length 892 [2025-02-05 10:52:55,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:52:55,182 INFO L471 AbstractCegarLoop]: Abstraction has 13092 states and 18672 transitions. [2025-02-05 10:52:55,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 283.0) internal successors, (849), 2 states have internal predecessors, (849), 0 states have call successors, (0), 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-02-05 10:52:55,182 INFO L276 IsEmpty]: Start isEmpty. Operand 13092 states and 18672 transitions. [2025-02-05 10:52:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 913 [2025-02-05 10:52:55,257 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:52:55,258 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:52:55,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:52:55,258 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:52:55,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:52:55,259 INFO L85 PathProgramCache]: Analyzing trace with hash -579543822, now seen corresponding path program 1 times [2025-02-05 10:52:55,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:52:55,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052620499] [2025-02-05 10:52:55,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:52:55,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:52:55,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 912 statements into 1 equivalence classes. [2025-02-05 10:52:55,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 912 of 912 statements. [2025-02-05 10:52:55,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:52:55,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:52:55,623 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-05 10:52:55,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:52:55,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052620499] [2025-02-05 10:52:55,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052620499] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:52:55,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:52:55,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:52:55,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009304870] [2025-02-05 10:52:55,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:52:55,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:52:55,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:52:55,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:52:55,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:52:55,627 INFO L87 Difference]: Start difference. First operand 13092 states and 18672 transitions. Second operand has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 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-02-05 10:52:57,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:52:57,960 INFO L93 Difference]: Finished difference Result 39270 states and 56011 transitions. [2025-02-05 10:52:57,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:52:57,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 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 912 [2025-02-05 10:52:57,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:52:58,008 INFO L225 Difference]: With dead ends: 39270 [2025-02-05 10:52:58,008 INFO L226 Difference]: Without dead ends: 26180 [2025-02-05 10:52:58,019 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-02-05 10:52:58,020 INFO L435 NwaCegarLoop]: 1486 mSDtfsCounter, 767 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 880 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 767 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 3261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 880 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:52:58,020 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [767 Valid, 1495 Invalid, 3261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [880 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 10:52:58,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26180 states. [2025-02-05 10:52:58,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26180 to 26180. [2025-02-05 10:52:58,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26180 states, 26179 states have (on average 1.366285954390924) internal successors, (35768), 26179 states have internal predecessors, (35768), 0 states have call successors, (0), 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-02-05 10:52:58,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26180 states to 26180 states and 35768 transitions. [2025-02-05 10:52:58,353 INFO L78 Accepts]: Start accepts. Automaton has 26180 states and 35768 transitions. Word has length 912 [2025-02-05 10:52:58,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:52:58,353 INFO L471 AbstractCegarLoop]: Abstraction has 26180 states and 35768 transitions. [2025-02-05 10:52:58,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 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-02-05 10:52:58,354 INFO L276 IsEmpty]: Start isEmpty. Operand 26180 states and 35768 transitions. [2025-02-05 10:52:58,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 931 [2025-02-05 10:52:58,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:52:58,380 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:52:58,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:52:58,380 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:52:58,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:52:58,381 INFO L85 PathProgramCache]: Analyzing trace with hash 68184232, now seen corresponding path program 1 times [2025-02-05 10:52:58,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:52:58,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658789795] [2025-02-05 10:52:58,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:52:58,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:52:58,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 930 statements into 1 equivalence classes. [2025-02-05 10:52:58,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 930 of 930 statements. [2025-02-05 10:52:58,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:52:58,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:52:59,042 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 10:52:59,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:52:59,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658789795] [2025-02-05 10:52:59,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658789795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:52:59,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:52:59,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:52:59,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321086143] [2025-02-05 10:52:59,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:52:59,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:52:59,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:52:59,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:52:59,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:52:59,048 INFO L87 Difference]: Start difference. First operand 26180 states and 35768 transitions. Second operand has 3 states, 3 states have (on average 299.0) internal successors, (897), 2 states have internal predecessors, (897), 0 states have call successors, (0), 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-02-05 10:53:01,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:53:01,503 INFO L93 Difference]: Finished difference Result 64628 states and 87968 transitions. [2025-02-05 10:53:01,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:53:01,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 299.0) internal successors, (897), 2 states have internal predecessors, (897), 0 states have call successors, (0), 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 930 [2025-02-05 10:53:01,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:53:01,650 INFO L225 Difference]: With dead ends: 64628 [2025-02-05 10:53:01,650 INFO L226 Difference]: Without dead ends: 38450 [2025-02-05 10:53:01,696 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-02-05 10:53:01,700 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 928 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2165 mSolverCounterSat, 1004 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 928 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 3169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1004 IncrementalHoareTripleChecker+Valid, 2165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:53:01,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [928 Valid, 311 Invalid, 3169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1004 Valid, 2165 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 10:53:01,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38450 states. [2025-02-05 10:53:02,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38450 to 38450. [2025-02-05 10:53:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38450 states, 38449 states have (on average 1.2489271502509818) internal successors, (48020), 38449 states have internal predecessors, (48020), 0 states have call successors, (0), 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-02-05 10:53:02,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38450 states to 38450 states and 48020 transitions. [2025-02-05 10:53:02,303 INFO L78 Accepts]: Start accepts. Automaton has 38450 states and 48020 transitions. Word has length 930 [2025-02-05 10:53:02,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:53:02,304 INFO L471 AbstractCegarLoop]: Abstraction has 38450 states and 48020 transitions. [2025-02-05 10:53:02,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.0) internal successors, (897), 2 states have internal predecessors, (897), 0 states have call successors, (0), 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-02-05 10:53:02,304 INFO L276 IsEmpty]: Start isEmpty. Operand 38450 states and 48020 transitions. [2025-02-05 10:53:02,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 970 [2025-02-05 10:53:02,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:53:02,340 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:53:02,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:53:02,340 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:53:02,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:53:02,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1089054713, now seen corresponding path program 1 times [2025-02-05 10:53:02,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:53:02,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172683411] [2025-02-05 10:53:02,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:53:02,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:53:02,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 969 statements into 1 equivalence classes. [2025-02-05 10:53:02,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 969 of 969 statements. [2025-02-05 10:53:02,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:53:02,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:53:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-02-05 10:53:02,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:53:02,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172683411] [2025-02-05 10:53:02,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172683411] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:53:02,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:53:02,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:53:02,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832204521] [2025-02-05 10:53:02,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:53:02,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:53:02,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:53:02,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:53:02,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:53:02,774 INFO L87 Difference]: Start difference. First operand 38450 states and 48020 transitions. Second operand has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 2 states have internal predecessors, (932), 0 states have call successors, (0), 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-02-05 10:53:05,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:53:05,555 INFO L93 Difference]: Finished difference Result 109618 states and 137165 transitions. [2025-02-05 10:53:05,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:53:05,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 2 states have internal predecessors, (932), 0 states have call successors, (0), 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 969 [2025-02-05 10:53:05,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:53:05,666 INFO L225 Difference]: With dead ends: 109618 [2025-02-05 10:53:05,666 INFO L226 Difference]: Without dead ends: 71170 [2025-02-05 10:53:05,683 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-02-05 10:53:05,684 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 954 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2065 mSolverCounterSat, 1063 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 3128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1063 IncrementalHoareTripleChecker+Valid, 2065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:53:05,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 474 Invalid, 3128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1063 Valid, 2065 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 10:53:05,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71170 states. [2025-02-05 10:53:06,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71170 to 57264. [2025-02-05 10:53:06,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57264 states, 57263 states have (on average 1.2089656497214607) internal successors, (69229), 57263 states have internal predecessors, (69229), 0 states have call successors, (0), 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-02-05 10:53:06,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57264 states to 57264 states and 69229 transitions. [2025-02-05 10:53:06,346 INFO L78 Accepts]: Start accepts. Automaton has 57264 states and 69229 transitions. Word has length 969 [2025-02-05 10:53:06,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:53:06,347 INFO L471 AbstractCegarLoop]: Abstraction has 57264 states and 69229 transitions. [2025-02-05 10:53:06,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 2 states have internal predecessors, (932), 0 states have call successors, (0), 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-02-05 10:53:06,347 INFO L276 IsEmpty]: Start isEmpty. Operand 57264 states and 69229 transitions. [2025-02-05 10:53:06,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1162 [2025-02-05 10:53:06,400 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:53:06,400 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:53:06,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 10:53:06,401 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:53:06,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:53:06,402 INFO L85 PathProgramCache]: Analyzing trace with hash -165928235, now seen corresponding path program 1 times [2025-02-05 10:53:06,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:53:06,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113603780] [2025-02-05 10:53:06,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:53:06,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:53:06,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1161 statements into 1 equivalence classes. [2025-02-05 10:53:06,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1161 of 1161 statements. [2025-02-05 10:53:06,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:53:06,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:53:07,381 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 499 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-02-05 10:53:07,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:53:07,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113603780] [2025-02-05 10:53:07,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113603780] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:53:07,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:53:07,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:53:07,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065683980] [2025-02-05 10:53:07,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:53:07,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:53:07,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:53:07,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:53:07,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:53:07,384 INFO L87 Difference]: Start difference. First operand 57264 states and 69229 transitions. Second operand has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 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-02-05 10:53:09,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:53:09,763 INFO L93 Difference]: Finished difference Result 116162 states and 140158 transitions. [2025-02-05 10:53:09,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:53:09,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 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 1161 [2025-02-05 10:53:09,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:53:09,888 INFO L225 Difference]: With dead ends: 116162 [2025-02-05 10:53:09,888 INFO L226 Difference]: Without dead ends: 58900 [2025-02-05 10:53:09,957 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-02-05 10:53:09,958 INFO L435 NwaCegarLoop]: 649 mSDtfsCounter, 823 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2022 mSolverCounterSat, 595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 2617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 595 IncrementalHoareTripleChecker+Valid, 2022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:53:09,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 657 Invalid, 2617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [595 Valid, 2022 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 10:53:10,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58900 states. [2025-02-05 10:53:10,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58900 to 58900. [2025-02-05 10:53:10,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58900 states, 58899 states have (on average 1.200818350056877) internal successors, (70727), 58899 states have internal predecessors, (70727), 0 states have call successors, (0), 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-02-05 10:53:10,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58900 states to 58900 states and 70727 transitions. [2025-02-05 10:53:10,761 INFO L78 Accepts]: Start accepts. Automaton has 58900 states and 70727 transitions. Word has length 1161 [2025-02-05 10:53:10,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:53:10,761 INFO L471 AbstractCegarLoop]: Abstraction has 58900 states and 70727 transitions. [2025-02-05 10:53:10,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 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-02-05 10:53:10,762 INFO L276 IsEmpty]: Start isEmpty. Operand 58900 states and 70727 transitions. [2025-02-05 10:53:10,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2025-02-05 10:53:10,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:53:10,799 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:53:10,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 10:53:10,800 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:53:10,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:53:10,801 INFO L85 PathProgramCache]: Analyzing trace with hash 871105448, now seen corresponding path program 1 times [2025-02-05 10:53:10,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:53:10,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856180168] [2025-02-05 10:53:10,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:53:10,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:53:10,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1209 statements into 1 equivalence classes. [2025-02-05 10:53:10,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1209 of 1209 statements. [2025-02-05 10:53:10,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:53:10,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:53:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 818 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2025-02-05 10:53:11,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:53:11,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856180168] [2025-02-05 10:53:11,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856180168] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:53:11,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:53:11,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:53:11,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145394092] [2025-02-05 10:53:11,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:53:11,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:53:11,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:53:11,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:53:11,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:53:11,887 INFO L87 Difference]: Start difference. First operand 58900 states and 70727 transitions. Second operand has 3 states, 3 states have (on average 304.0) internal successors, (912), 2 states have internal predecessors, (912), 0 states have call successors, (0), 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-02-05 10:53:14,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:53:14,359 INFO L93 Difference]: Finished difference Result 121070 states and 144958 transitions. [2025-02-05 10:53:14,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:53:14,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 304.0) internal successors, (912), 2 states have internal predecessors, (912), 0 states have call successors, (0), 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 1209 [2025-02-05 10:53:14,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:53:14,418 INFO L225 Difference]: With dead ends: 121070 [2025-02-05 10:53:14,419 INFO L226 Difference]: Without dead ends: 62172 [2025-02-05 10:53:14,443 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-02-05 10:53:14,444 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 731 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 795 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 2970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 795 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:53:14,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 519 Invalid, 2970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [795 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-02-05 10:53:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62172 states. [2025-02-05 10:53:14,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62172 to 62172. [2025-02-05 10:53:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62172 states, 62171 states have (on average 1.1888018529539497) internal successors, (73909), 62171 states have internal predecessors, (73909), 0 states have call successors, (0), 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-02-05 10:53:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62172 states to 62172 states and 73909 transitions. [2025-02-05 10:53:14,883 INFO L78 Accepts]: Start accepts. Automaton has 62172 states and 73909 transitions. Word has length 1209 [2025-02-05 10:53:14,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:53:14,883 INFO L471 AbstractCegarLoop]: Abstraction has 62172 states and 73909 transitions. [2025-02-05 10:53:14,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.0) internal successors, (912), 2 states have internal predecessors, (912), 0 states have call successors, (0), 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-02-05 10:53:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand 62172 states and 73909 transitions. [2025-02-05 10:53:15,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1225 [2025-02-05 10:53:15,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:53:15,021 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:53:15,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 10:53:15,021 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:53:15,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:53:15,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1123104207, now seen corresponding path program 1 times [2025-02-05 10:53:15,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:53:15,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062671749] [2025-02-05 10:53:15,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:53:15,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:53:15,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1224 statements into 1 equivalence classes. [2025-02-05 10:53:15,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1224 of 1224 statements. [2025-02-05 10:53:15,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:53:15,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:53:15,484 INFO L134 CoverageAnalysis]: Checked inductivity of 892 backedges. 658 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-02-05 10:53:15,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:53:15,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062671749] [2025-02-05 10:53:15,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062671749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:53:15,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:53:15,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:53:15,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310782852] [2025-02-05 10:53:15,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:53:15,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:53:15,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:53:15,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:53:15,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:53:15,486 INFO L87 Difference]: Start difference. First operand 62172 states and 73909 transitions. Second operand has 3 states, 3 states have (on average 339.0) internal successors, (1017), 3 states have internal predecessors, (1017), 0 states have call successors, (0), 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-02-05 10:53:17,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:53:17,937 INFO L93 Difference]: Finished difference Result 140702 states and 167944 transitions. [2025-02-05 10:53:17,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:53:17,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 339.0) internal successors, (1017), 3 states have internal predecessors, (1017), 0 states have call successors, (0), 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 1224 [2025-02-05 10:53:17,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:53:18,019 INFO L225 Difference]: With dead ends: 140702 [2025-02-05 10:53:18,019 INFO L226 Difference]: Without dead ends: 78532 [2025-02-05 10:53:18,049 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-02-05 10:53:18,050 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 914 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2265 mSolverCounterSat, 962 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 3227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 962 IncrementalHoareTripleChecker+Valid, 2265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:53:18,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 426 Invalid, 3227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [962 Valid, 2265 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-05 10:53:18,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78532 states. [2025-02-05 10:53:18,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78532 to 78532. [2025-02-05 10:53:18,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78532 states, 78531 states have (on average 1.1703276413136214) internal successors, (91907), 78531 states have internal predecessors, (91907), 0 states have call successors, (0), 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-02-05 10:53:18,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78532 states to 78532 states and 91907 transitions. [2025-02-05 10:53:18,965 INFO L78 Accepts]: Start accepts. Automaton has 78532 states and 91907 transitions. Word has length 1224 [2025-02-05 10:53:18,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:53:18,966 INFO L471 AbstractCegarLoop]: Abstraction has 78532 states and 91907 transitions. [2025-02-05 10:53:18,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 339.0) internal successors, (1017), 3 states have internal predecessors, (1017), 0 states have call successors, (0), 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-02-05 10:53:18,966 INFO L276 IsEmpty]: Start isEmpty. Operand 78532 states and 91907 transitions. [2025-02-05 10:53:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1261 [2025-02-05 10:53:19,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:53:19,012 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:53:19,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 10:53:19,012 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:53:19,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:53:19,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1202574771, now seen corresponding path program 1 times [2025-02-05 10:53:19,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:53:19,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842515933] [2025-02-05 10:53:19,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:53:19,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:53:19,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1260 statements into 1 equivalence classes. [2025-02-05 10:53:19,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1260 of 1260 statements. [2025-02-05 10:53:19,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:53:19,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:53:21,434 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 467 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-02-05 10:53:21,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:53:21,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842515933] [2025-02-05 10:53:21,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842515933] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:53:21,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:53:21,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 10:53:21,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359159891] [2025-02-05 10:53:21,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:53:21,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 10:53:21,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:53:21,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 10:53:21,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:53:21,437 INFO L87 Difference]: Start difference. First operand 78532 states and 91907 transitions. Second operand has 6 states, 6 states have (on average 186.16666666666666) internal successors, (1117), 5 states have internal predecessors, (1117), 0 states have call successors, (0), 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-02-05 10:53:24,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:53:24,393 INFO L93 Difference]: Finished difference Result 157880 states and 184654 transitions. [2025-02-05 10:53:24,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:53:24,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 186.16666666666666) internal successors, (1117), 5 states have internal predecessors, (1117), 0 states have call successors, (0), 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 1260 [2025-02-05 10:53:24,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:53:24,481 INFO L225 Difference]: With dead ends: 157880 [2025-02-05 10:53:24,481 INFO L226 Difference]: Without dead ends: 79350 [2025-02-05 10:53:24,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:53:24,526 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 1531 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 4024 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1531 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 4042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:53:24,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1531 Valid, 1310 Invalid, 4042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4024 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 10:53:24,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79350 states. [2025-02-05 10:53:25,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79350 to 79350. [2025-02-05 10:53:25,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79350 states, 79349 states have (on average 1.168647367956748) internal successors, (92731), 79349 states have internal predecessors, (92731), 0 states have call successors, (0), 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-02-05 10:53:25,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79350 states to 79350 states and 92731 transitions. [2025-02-05 10:53:25,218 INFO L78 Accepts]: Start accepts. Automaton has 79350 states and 92731 transitions. Word has length 1260 [2025-02-05 10:53:25,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:53:25,218 INFO L471 AbstractCegarLoop]: Abstraction has 79350 states and 92731 transitions. [2025-02-05 10:53:25,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 186.16666666666666) internal successors, (1117), 5 states have internal predecessors, (1117), 0 states have call successors, (0), 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-02-05 10:53:25,218 INFO L276 IsEmpty]: Start isEmpty. Operand 79350 states and 92731 transitions. [2025-02-05 10:53:25,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1276 [2025-02-05 10:53:25,265 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:53:25,265 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:53:25,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 10:53:25,266 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:53:25,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:53:25,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1756152634, now seen corresponding path program 1 times [2025-02-05 10:53:25,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:53:25,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839194805] [2025-02-05 10:53:25,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:53:25,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:53:25,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1275 statements into 1 equivalence classes. [2025-02-05 10:53:25,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1275 of 1275 statements. [2025-02-05 10:53:25,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:53:25,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:53:26,881 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 541 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2025-02-05 10:53:26,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:53:26,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839194805] [2025-02-05 10:53:26,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839194805] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:53:26,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:53:26,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 10:53:26,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576152355] [2025-02-05 10:53:26,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:53:26,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 10:53:26,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:53:26,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 10:53:26,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:53:26,884 INFO L87 Difference]: Start difference. First operand 79350 states and 92731 transitions. Second operand has 6 states, 6 states have (on average 188.66666666666666) internal successors, (1132), 5 states have internal predecessors, (1132), 0 states have call successors, (0), 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-02-05 10:53:31,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:53:31,084 INFO L93 Difference]: Finished difference Result 160334 states and 187180 transitions. [2025-02-05 10:53:31,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 10:53:31,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 188.66666666666666) internal successors, (1132), 5 states have internal predecessors, (1132), 0 states have call successors, (0), 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 1275 [2025-02-05 10:53:31,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:53:31,171 INFO L225 Difference]: With dead ends: 160334 [2025-02-05 10:53:31,171 INFO L226 Difference]: Without dead ends: 81804 [2025-02-05 10:53:31,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:53:31,209 INFO L435 NwaCegarLoop]: 746 mSDtfsCounter, 1535 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 7530 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1535 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 7564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 7530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:53:31,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1535 Valid, 1825 Invalid, 7564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 7530 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-02-05 10:53:31,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81804 states. [2025-02-05 10:53:31,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81804 to 81804. [2025-02-05 10:53:31,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81804 states, 81803 states have (on average 1.1641749080107087) internal successors, (95233), 81803 states have internal predecessors, (95233), 0 states have call successors, (0), 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-02-05 10:53:31,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81804 states to 81804 states and 95233 transitions. [2025-02-05 10:53:31,860 INFO L78 Accepts]: Start accepts. Automaton has 81804 states and 95233 transitions. Word has length 1275 [2025-02-05 10:53:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:53:31,861 INFO L471 AbstractCegarLoop]: Abstraction has 81804 states and 95233 transitions. [2025-02-05 10:53:31,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.66666666666666) internal successors, (1132), 5 states have internal predecessors, (1132), 0 states have call successors, (0), 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-02-05 10:53:31,861 INFO L276 IsEmpty]: Start isEmpty. Operand 81804 states and 95233 transitions. [2025-02-05 10:53:31,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1283 [2025-02-05 10:53:31,907 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:53:31,907 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, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:53:31,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 10:53:31,908 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:53:31,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:53:31,909 INFO L85 PathProgramCache]: Analyzing trace with hash -751967585, now seen corresponding path program 1 times [2025-02-05 10:53:31,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:53:31,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179871597] [2025-02-05 10:53:31,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:53:31,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:53:32,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1282 statements into 1 equivalence classes. [2025-02-05 10:53:32,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1282 of 1282 statements. [2025-02-05 10:53:32,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:53:32,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:53:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 701 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-02-05 10:53:32,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:53:32,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179871597] [2025-02-05 10:53:32,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179871597] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:53:32,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:53:32,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:53:32,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406412820] [2025-02-05 10:53:32,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:53:32,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:53:32,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:53:32,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:53:32,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:53:32,574 INFO L87 Difference]: Start difference. First operand 81804 states and 95233 transitions. Second operand has 3 states, 3 states have (on average 394.0) internal successors, (1182), 3 states have internal predecessors, (1182), 0 states have call successors, (0), 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-02-05 10:53:35,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:53:35,178 INFO L93 Difference]: Finished difference Result 162786 states and 189639 transitions. [2025-02-05 10:53:35,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:53:35,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 394.0) internal successors, (1182), 3 states have internal predecessors, (1182), 0 states have call successors, (0), 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 1282 [2025-02-05 10:53:35,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:53:35,180 INFO L225 Difference]: With dead ends: 162786 [2025-02-05 10:53:35,180 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 10:53:35,215 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-02-05 10:53:35,216 INFO L435 NwaCegarLoop]: 1355 mSDtfsCounter, 784 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 3084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:53:35,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 1363 Invalid, 3084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 10:53:35,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 10:53:35,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 10:53:35,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:53:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 10:53:35,217 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1282 [2025-02-05 10:53:35,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:53:35,217 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 10:53:35,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 394.0) internal successors, (1182), 3 states have internal predecessors, (1182), 0 states have call successors, (0), 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-02-05 10:53:35,218 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 10:53:35,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 10:53:35,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 10:53:35,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 10:53:35,223 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:53:35,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 10:53:36,027 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 10:53:36,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:53:36 BoogieIcfgContainer [2025-02-05 10:53:36,037 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 10:53:36,037 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 10:53:36,037 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 10:53:36,038 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 10:53:36,038 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:52:40" (3/4) ... [2025-02-05 10:53:36,039 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 10:53:36,071 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-05 10:53:36,075 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 10:53:36,080 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 10:53:36,084 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 10:53:36,420 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 10:53:36,420 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 10:53:36,420 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 10:53:36,423 INFO L158 Benchmark]: Toolchain (without parser) took 60622.52ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 97.7MB in the beginning and 853.8MB in the end (delta: -756.1MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2025-02-05 10:53:36,423 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:53:36,423 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1073.84ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 60.3MB in the end (delta: 37.3MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. [2025-02-05 10:53:36,423 INFO L158 Benchmark]: Boogie Procedure Inliner took 212.59ms. Allocated memory is still 142.6MB. Free memory was 60.3MB in the beginning and 57.5MB in the end (delta: 2.9MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. [2025-02-05 10:53:36,424 INFO L158 Benchmark]: Boogie Preprocessor took 256.77ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 57.5MB in the beginning and 155.4MB in the end (delta: -97.9MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2025-02-05 10:53:36,424 INFO L158 Benchmark]: IcfgBuilder took 3495.04ms. Allocated memory was 251.7MB in the beginning and 394.3MB in the end (delta: 142.6MB). Free memory was 155.4MB in the beginning and 198.7MB in the end (delta: -43.3MB). Peak memory consumption was 127.6MB. Max. memory is 16.1GB. [2025-02-05 10:53:36,424 INFO L158 Benchmark]: TraceAbstraction took 55191.94ms. Allocated memory was 394.3MB in the beginning and 1.3GB in the end (delta: 897.6MB). Free memory was 198.7MB in the beginning and 226.4MB in the end (delta: -27.7MB). Peak memory consumption was 876.1MB. Max. memory is 16.1GB. [2025-02-05 10:53:36,424 INFO L158 Benchmark]: Witness Printer took 382.83ms. Allocated memory is still 1.3GB. Free memory was 226.4MB in the beginning and 853.8MB in the end (delta: -627.3MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. [2025-02-05 10:53:36,425 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1073.84ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 60.3MB in the end (delta: 37.3MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 212.59ms. Allocated memory is still 142.6MB. Free memory was 60.3MB in the beginning and 57.5MB in the end (delta: 2.9MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 256.77ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 57.5MB in the beginning and 155.4MB in the end (delta: -97.9MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * IcfgBuilder took 3495.04ms. Allocated memory was 251.7MB in the beginning and 394.3MB in the end (delta: 142.6MB). Free memory was 155.4MB in the beginning and 198.7MB in the end (delta: -43.3MB). Peak memory consumption was 127.6MB. Max. memory is 16.1GB. * TraceAbstraction took 55191.94ms. Allocated memory was 394.3MB in the beginning and 1.3GB in the end (delta: 897.6MB). Free memory was 198.7MB in the beginning and 226.4MB in the end (delta: -27.7MB). Peak memory consumption was 876.1MB. Max. memory is 16.1GB. * Witness Printer took 382.83ms. Allocated memory is still 1.3GB. Free memory was 226.4MB in the beginning and 853.8MB in the end (delta: -627.3MB). Peak memory consumption was 31.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 4731]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 885 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 54.3s, OverallIterations: 13, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.6s, AutomataDifference: 36.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12035 SdHoareTripleChecker+Valid, 31.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12035 mSDsluCounter, 9714 SdHoareTripleChecker+Invalid, 26.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1719 mSDsCounter, 9676 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36795 IncrementalHoareTripleChecker+Invalid, 46471 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9676 mSolverCounterUnsat, 7995 mSDtfsCounter, 36795 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81804occurred in iteration=12, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 13906 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 13538 NumberOfCodeBlocks, 13538 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 13525 ConstructedInterpolants, 0 QuantifiedInterpolants, 24303 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 5698/5698 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4826]: Location Invariant Derived location invariant: ((((((((a28 <= 16) && (a7 == 1)) || (a14 <= 19)) || ((17 <= a4) && (a28 <= 16))) || ((a3 == 1) && (17 <= a28))) || (a28 <= 15)) || ((a26 <= 17) && (a28 <= 16))) || ((a4 <= 17) && (17 <= a28))) RESULT: Ultimate proved your program to be correct! [2025-02-05 10:53:36,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE