./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label45.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label45.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 e46cda06cd6f3e72cb5a00e680e37793de7d3fd440c55f6638f7eefc5d4b52af --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:57:20,771 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:57:20,812 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:57:20,816 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:57:20,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:57:20,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:57:20,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:57:20,830 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:57:20,831 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:57:20,831 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:57:20,831 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:57:20,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:57:20,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:57:20,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:57:20,831 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:57:20,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:57:20,831 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:57:20,831 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:57:20,831 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:57:20,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:57:20,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:57:20,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:57:20,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:57:20,832 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:57:20,832 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:57:20,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:57:20,832 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:57:20,832 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:57:20,832 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:57:20,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:57:20,832 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:57:20,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:57:20,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:57:20,832 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:57:20,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:57:20,832 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:57:20,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:57:20,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:57:20,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:57:20,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:57:20,833 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:57:20,833 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:57:20,833 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:57:20,833 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:57:20,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:57:20,833 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:57:20,833 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:57:20,833 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:57:20,833 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 -> e46cda06cd6f3e72cb5a00e680e37793de7d3fd440c55f6638f7eefc5d4b52af [2025-01-08 22:57:21,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:57:21,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:57:21,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:57:21,058 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:57:21,058 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:57:21,059 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label45.c [2025-01-08 22:57:22,359 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce4b0fde4/84d5f5ed9a51493b9496fc510ccd9dd0/FLAG662f17ba8 [2025-01-08 22:57:22,885 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:57:22,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label45.c [2025-01-08 22:57:22,897 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce4b0fde4/84d5f5ed9a51493b9496fc510ccd9dd0/FLAG662f17ba8 [2025-01-08 22:57:22,994 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ce4b0fde4/84d5f5ed9a51493b9496fc510ccd9dd0 [2025-01-08 22:57:22,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:57:22,999 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:57:23,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:57:23,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:57:23,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:57:23,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:57:22" (1/1) ... [2025-01-08 22:57:23,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@738abb7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:23, skipping insertion in model container [2025-01-08 22:57:23,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:57:22" (1/1) ... [2025-01-08 22:57:23,052 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:57:23,381 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/Problem03_label45.c[53653,53666] [2025-01-08 22:57:23,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:57:23,438 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:57:23,559 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/Problem03_label45.c[53653,53666] [2025-01-08 22:57:23,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:57:23,594 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:57:23,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:23 WrapperNode [2025-01-08 22:57:23,595 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:57:23,596 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:57:23,596 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:57:23,600 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:57:23,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:23" (1/1) ... [2025-01-08 22:57:23,649 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:23" (1/1) ... [2025-01-08 22:57:23,744 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-01-08 22:57:23,744 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:57:23,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:57:23,745 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:57:23,745 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:57:23,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:23" (1/1) ... [2025-01-08 22:57:23,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:23" (1/1) ... [2025-01-08 22:57:23,762 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:23" (1/1) ... [2025-01-08 22:57:23,788 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 22:57:23,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:23" (1/1) ... [2025-01-08 22:57:23,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:23" (1/1) ... [2025-01-08 22:57:23,819 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:23" (1/1) ... [2025-01-08 22:57:23,823 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:23" (1/1) ... [2025-01-08 22:57:23,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:23" (1/1) ... [2025-01-08 22:57:23,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:23" (1/1) ... [2025-01-08 22:57:23,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:23" (1/1) ... [2025-01-08 22:57:23,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:57:23,918 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:57:23,918 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:57:23,918 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:57:23,919 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:23" (1/1) ... [2025-01-08 22:57:23,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:57:23,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:57:23,941 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:57:23,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 22:57:23,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:57:23,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:57:23,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:57:23,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:57:24,030 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:57:24,032 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:57:25,596 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-01-08 22:57:25,597 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:57:25,611 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:57:25,611 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:57:25,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:57:25 BoogieIcfgContainer [2025-01-08 22:57:25,612 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:57:25,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:57:25,614 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:57:25,617 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:57:25,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:57:22" (1/3) ... [2025-01-08 22:57:25,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@647d7d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:57:25, skipping insertion in model container [2025-01-08 22:57:25,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:57:23" (2/3) ... [2025-01-08 22:57:25,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@647d7d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:57:25, skipping insertion in model container [2025-01-08 22:57:25,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:57:25" (3/3) ... [2025-01-08 22:57:25,620 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label45.c [2025-01-08 22:57:25,630 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:57:25,633 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label45.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:57:25,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:57:25,694 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;@5cefa224, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:57:25,694 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:57:25,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:25,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-08 22:57:25,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:25,715 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] [2025-01-08 22:57:25,715 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:25,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:25,719 INFO L85 PathProgramCache]: Analyzing trace with hash 2077984674, now seen corresponding path program 1 times [2025-01-08 22:57:25,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:25,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194195241] [2025-01-08 22:57:25,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:25,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:25,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-08 22:57:25,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-08 22:57:25,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:25,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:26,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:57:26,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:26,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194195241] [2025-01-08 22:57:26,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194195241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:26,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:26,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:57:26,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644980148] [2025-01-08 22:57:26,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:26,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:26,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:26,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:26,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:26,371 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 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 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:27,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:27,175 INFO L93 Difference]: Finished difference Result 855 states and 1493 transitions. [2025-01-08 22:57:27,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:27,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2025-01-08 22:57:27,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:27,184 INFO L225 Difference]: With dead ends: 855 [2025-01-08 22:57:27,184 INFO L226 Difference]: Without dead ends: 460 [2025-01-08 22:57:27,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:27,189 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 152 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:27,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 174 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:57:27,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-01-08 22:57:27,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 459. [2025-01-08 22:57:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.5502183406113537) internal successors, (710), 458 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 710 transitions. [2025-01-08 22:57:27,229 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 710 transitions. Word has length 144 [2025-01-08 22:57:27,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:27,230 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 710 transitions. [2025-01-08 22:57:27,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 2 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:27,230 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 710 transitions. [2025-01-08 22:57:27,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-08 22:57:27,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:27,234 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:57:27,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:57:27,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:27,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:27,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1910264211, now seen corresponding path program 1 times [2025-01-08 22:57:27,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:27,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543763800] [2025-01-08 22:57:27,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:27,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:27,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-08 22:57:27,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-08 22:57:27,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:27,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:27,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:57:27,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:27,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543763800] [2025-01-08 22:57:27,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543763800] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:27,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:27,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:57:27,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880907180] [2025-01-08 22:57:27,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:27,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:27,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:27,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:27,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:27,468 INFO L87 Difference]: Start difference. First operand 459 states and 710 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:27,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:27,694 INFO L93 Difference]: Finished difference Result 1369 states and 2122 transitions. [2025-01-08 22:57:27,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:27,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-01-08 22:57:27,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:27,698 INFO L225 Difference]: With dead ends: 1369 [2025-01-08 22:57:27,698 INFO L226 Difference]: Without dead ends: 912 [2025-01-08 22:57:27,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:27,699 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 366 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:27,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 600 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:57:27,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-01-08 22:57:27,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 909. [2025-01-08 22:57:27,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 909 states, 908 states have (on average 1.551762114537445) internal successors, (1409), 908 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:27,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1409 transitions. [2025-01-08 22:57:27,746 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1409 transitions. Word has length 149 [2025-01-08 22:57:27,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:27,747 INFO L471 AbstractCegarLoop]: Abstraction has 909 states and 1409 transitions. [2025-01-08 22:57:27,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:27,747 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1409 transitions. [2025-01-08 22:57:27,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-08 22:57:27,753 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:27,753 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 22:57:27,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:57:27,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:27,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:27,754 INFO L85 PathProgramCache]: Analyzing trace with hash -6189887, now seen corresponding path program 1 times [2025-01-08 22:57:27,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:27,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777579966] [2025-01-08 22:57:27,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:27,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:27,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-08 22:57:27,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-08 22:57:27,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:27,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:27,911 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:57:27,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:27,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777579966] [2025-01-08 22:57:27,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777579966] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:27,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:27,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:57:27,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689390982] [2025-01-08 22:57:27,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:27,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:27,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:27,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:27,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:27,914 INFO L87 Difference]: Start difference. First operand 909 states and 1409 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:28,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:28,579 INFO L93 Difference]: Finished difference Result 2677 states and 4173 transitions. [2025-01-08 22:57:28,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:28,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2025-01-08 22:57:28,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:28,585 INFO L225 Difference]: With dead ends: 2677 [2025-01-08 22:57:28,586 INFO L226 Difference]: Without dead ends: 1770 [2025-01-08 22:57:28,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:28,587 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 236 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:28,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 155 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:57:28,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2025-01-08 22:57:28,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1734. [2025-01-08 22:57:28,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1733 states have (on average 1.5187536064627813) internal successors, (2632), 1733 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:28,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2632 transitions. [2025-01-08 22:57:28,637 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2632 transitions. Word has length 152 [2025-01-08 22:57:28,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:28,637 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2632 transitions. [2025-01-08 22:57:28,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:28,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2632 transitions. [2025-01-08 22:57:28,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-08 22:57:28,640 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:28,640 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 22:57:28,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:57:28,640 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:28,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:28,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1917842030, now seen corresponding path program 1 times [2025-01-08 22:57:28,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:28,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330642909] [2025-01-08 22:57:28,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:28,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:28,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-08 22:57:28,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-08 22:57:28,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:28,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:28,769 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:57:28,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:28,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330642909] [2025-01-08 22:57:28,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330642909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:28,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:28,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:57:28,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906390303] [2025-01-08 22:57:28,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:28,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:28,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:28,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:28,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:28,771 INFO L87 Difference]: Start difference. First operand 1734 states and 2632 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:29,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:29,448 INFO L93 Difference]: Finished difference Result 5118 states and 7786 transitions. [2025-01-08 22:57:29,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:29,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2025-01-08 22:57:29,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:29,457 INFO L225 Difference]: With dead ends: 5118 [2025-01-08 22:57:29,458 INFO L226 Difference]: Without dead ends: 3386 [2025-01-08 22:57:29,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:29,461 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 242 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:29,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 182 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:57:29,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3386 states. [2025-01-08 22:57:29,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3386 to 3378. [2025-01-08 22:57:29,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3378 states, 3377 states have (on average 1.4382588095943145) internal successors, (4857), 3377 states have internal predecessors, (4857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:29,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3378 states to 3378 states and 4857 transitions. [2025-01-08 22:57:29,529 INFO L78 Accepts]: Start accepts. Automaton has 3378 states and 4857 transitions. Word has length 158 [2025-01-08 22:57:29,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:29,529 INFO L471 AbstractCegarLoop]: Abstraction has 3378 states and 4857 transitions. [2025-01-08 22:57:29,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:29,529 INFO L276 IsEmpty]: Start isEmpty. Operand 3378 states and 4857 transitions. [2025-01-08 22:57:29,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-08 22:57:29,535 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:29,536 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:57:29,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:57:29,536 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:29,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:29,537 INFO L85 PathProgramCache]: Analyzing trace with hash 270179555, now seen corresponding path program 1 times [2025-01-08 22:57:29,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:29,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803005302] [2025-01-08 22:57:29,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:29,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:29,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-08 22:57:29,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-08 22:57:29,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:29,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:29,670 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:57:29,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:29,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803005302] [2025-01-08 22:57:29,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803005302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:29,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:29,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:57:29,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913051314] [2025-01-08 22:57:29,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:29,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:29,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:29,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:29,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:29,671 INFO L87 Difference]: Start difference. First operand 3378 states and 4857 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:30,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:30,516 INFO L93 Difference]: Finished difference Result 6752 states and 9709 transitions. [2025-01-08 22:57:30,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:30,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2025-01-08 22:57:30,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:30,525 INFO L225 Difference]: With dead ends: 6752 [2025-01-08 22:57:30,525 INFO L226 Difference]: Without dead ends: 3376 [2025-01-08 22:57:30,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:30,528 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 269 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:30,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 375 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:57:30,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3376 states. [2025-01-08 22:57:30,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3376 to 3370. [2025-01-08 22:57:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3370 states, 3369 states have (on average 1.352923716236272) internal successors, (4558), 3369 states have internal predecessors, (4558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:30,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 3370 states and 4558 transitions. [2025-01-08 22:57:30,575 INFO L78 Accepts]: Start accepts. Automaton has 3370 states and 4558 transitions. Word has length 166 [2025-01-08 22:57:30,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:30,576 INFO L471 AbstractCegarLoop]: Abstraction has 3370 states and 4558 transitions. [2025-01-08 22:57:30,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:30,576 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 4558 transitions. [2025-01-08 22:57:30,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-08 22:57:30,580 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:30,580 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:57:30,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:57:30,580 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:30,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:30,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1341456916, now seen corresponding path program 1 times [2025-01-08 22:57:30,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:30,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198098525] [2025-01-08 22:57:30,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:30,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:30,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-08 22:57:30,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-08 22:57:30,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:30,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:30,673 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-08 22:57:30,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:30,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198098525] [2025-01-08 22:57:30,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198098525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:30,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:30,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:57:30,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828661772] [2025-01-08 22:57:30,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:30,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:30,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:30,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:30,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:30,674 INFO L87 Difference]: Start difference. First operand 3370 states and 4558 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:30,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:30,977 INFO L93 Difference]: Finished difference Result 6674 states and 9028 transitions. [2025-01-08 22:57:30,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:30,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 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 172 [2025-01-08 22:57:30,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:30,986 INFO L225 Difference]: With dead ends: 6674 [2025-01-08 22:57:30,986 INFO L226 Difference]: Without dead ends: 3306 [2025-01-08 22:57:30,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:30,989 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 326 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:30,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:57:30,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3306 states. [2025-01-08 22:57:31,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3306 to 3306. [2025-01-08 22:57:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3306 states, 3305 states have (on average 1.325264750378215) internal successors, (4380), 3305 states have internal predecessors, (4380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:31,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 4380 transitions. [2025-01-08 22:57:31,073 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 4380 transitions. Word has length 172 [2025-01-08 22:57:31,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:31,075 INFO L471 AbstractCegarLoop]: Abstraction has 3306 states and 4380 transitions. [2025-01-08 22:57:31,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:31,075 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 4380 transitions. [2025-01-08 22:57:31,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-08 22:57:31,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:31,080 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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] [2025-01-08 22:57:31,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:57:31,080 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:31,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:31,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1453770443, now seen corresponding path program 1 times [2025-01-08 22:57:31,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:31,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737394469] [2025-01-08 22:57:31,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:31,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:31,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-08 22:57:31,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-08 22:57:31,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:31,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:31,302 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-08 22:57:31,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:31,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737394469] [2025-01-08 22:57:31,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737394469] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:31,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:31,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:57:31,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094620430] [2025-01-08 22:57:31,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:31,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:31,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:31,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:31,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:31,305 INFO L87 Difference]: Start difference. First operand 3306 states and 4380 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:31,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:31,953 INFO L93 Difference]: Finished difference Result 8250 states and 10896 transitions. [2025-01-08 22:57:31,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:31,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2025-01-08 22:57:31,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:31,967 INFO L225 Difference]: With dead ends: 8250 [2025-01-08 22:57:31,967 INFO L226 Difference]: Without dead ends: 4946 [2025-01-08 22:57:31,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:31,971 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 210 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:31,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 360 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:57:31,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4946 states. [2025-01-08 22:57:32,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4946 to 4938. [2025-01-08 22:57:32,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4938 states, 4937 states have (on average 1.2829653635811222) internal successors, (6334), 4937 states have internal predecessors, (6334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:32,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4938 states to 4938 states and 6334 transitions. [2025-01-08 22:57:32,048 INFO L78 Accepts]: Start accepts. Automaton has 4938 states and 6334 transitions. Word has length 172 [2025-01-08 22:57:32,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:32,049 INFO L471 AbstractCegarLoop]: Abstraction has 4938 states and 6334 transitions. [2025-01-08 22:57:32,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:32,049 INFO L276 IsEmpty]: Start isEmpty. Operand 4938 states and 6334 transitions. [2025-01-08 22:57:32,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-01-08 22:57:32,054 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:32,054 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2025-01-08 22:57:32,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:57:32,054 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:32,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:32,055 INFO L85 PathProgramCache]: Analyzing trace with hash -344474825, now seen corresponding path program 1 times [2025-01-08 22:57:32,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:32,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734669527] [2025-01-08 22:57:32,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:32,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:32,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-08 22:57:32,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-08 22:57:32,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:32,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:32,164 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:57:32,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:32,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734669527] [2025-01-08 22:57:32,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734669527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:32,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:32,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:57:32,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778823936] [2025-01-08 22:57:32,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:32,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:32,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:32,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:32,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:32,166 INFO L87 Difference]: Start difference. First operand 4938 states and 6334 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:32,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:32,529 INFO L93 Difference]: Finished difference Result 14781 states and 18960 transitions. [2025-01-08 22:57:32,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:32,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 173 [2025-01-08 22:57:32,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:32,563 INFO L225 Difference]: With dead ends: 14781 [2025-01-08 22:57:32,564 INFO L226 Difference]: Without dead ends: 9845 [2025-01-08 22:57:32,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:32,571 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 316 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:32,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 476 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:57:32,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9845 states. [2025-01-08 22:57:32,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9845 to 9843. [2025-01-08 22:57:32,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9843 states, 9842 states have (on average 1.2805324121113595) internal successors, (12603), 9842 states have internal predecessors, (12603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:32,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9843 states to 9843 states and 12603 transitions. [2025-01-08 22:57:32,758 INFO L78 Accepts]: Start accepts. Automaton has 9843 states and 12603 transitions. Word has length 173 [2025-01-08 22:57:32,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:32,760 INFO L471 AbstractCegarLoop]: Abstraction has 9843 states and 12603 transitions. [2025-01-08 22:57:32,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:32,760 INFO L276 IsEmpty]: Start isEmpty. Operand 9843 states and 12603 transitions. [2025-01-08 22:57:32,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-01-08 22:57:32,773 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:32,774 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:57:32,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:57:32,774 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:32,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:32,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1675428656, now seen corresponding path program 1 times [2025-01-08 22:57:32,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:32,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405793668] [2025-01-08 22:57:32,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:32,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:32,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-08 22:57:32,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-08 22:57:32,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:32,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:32,990 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-08 22:57:32,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:32,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405793668] [2025-01-08 22:57:32,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405793668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:32,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:32,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:57:32,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527254861] [2025-01-08 22:57:32,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:32,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:57:32,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:32,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:57:32,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:57:32,992 INFO L87 Difference]: Start difference. First operand 9843 states and 12603 transitions. Second operand has 4 states, 4 states have (on average 45.5) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:34,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:34,027 INFO L93 Difference]: Finished difference Result 21756 states and 27914 transitions. [2025-01-08 22:57:34,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:57:34,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 188 [2025-01-08 22:57:34,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:34,046 INFO L225 Difference]: With dead ends: 21756 [2025-01-08 22:57:34,046 INFO L226 Difference]: Without dead ends: 11915 [2025-01-08 22:57:34,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:57:34,060 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 399 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 1319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:34,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 96 Invalid, 1319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 22:57:34,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11915 states. [2025-01-08 22:57:34,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11915 to 9843. [2025-01-08 22:57:34,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9843 states, 9842 states have (on average 1.2805324121113595) internal successors, (12603), 9842 states have internal predecessors, (12603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9843 states to 9843 states and 12603 transitions. [2025-01-08 22:57:34,213 INFO L78 Accepts]: Start accepts. Automaton has 9843 states and 12603 transitions. Word has length 188 [2025-01-08 22:57:34,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:34,213 INFO L471 AbstractCegarLoop]: Abstraction has 9843 states and 12603 transitions. [2025-01-08 22:57:34,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.5) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:34,213 INFO L276 IsEmpty]: Start isEmpty. Operand 9843 states and 12603 transitions. [2025-01-08 22:57:34,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-08 22:57:34,259 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:34,259 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 22:57:34,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:57:34,259 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:34,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:34,260 INFO L85 PathProgramCache]: Analyzing trace with hash 882554780, now seen corresponding path program 1 times [2025-01-08 22:57:34,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:34,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814358713] [2025-01-08 22:57:34,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:34,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:34,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-08 22:57:34,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-08 22:57:34,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:34,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:34,398 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-08 22:57:34,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:34,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814358713] [2025-01-08 22:57:34,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814358713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:34,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:34,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:57:34,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197191636] [2025-01-08 22:57:34,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:34,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:34,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:34,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:34,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:34,400 INFO L87 Difference]: Start difference. First operand 9843 states and 12603 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:35,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:35,067 INFO L93 Difference]: Finished difference Result 26244 states and 33392 transitions. [2025-01-08 22:57:35,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:35,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 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 194 [2025-01-08 22:57:35,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:35,093 INFO L225 Difference]: With dead ends: 26244 [2025-01-08 22:57:35,094 INFO L226 Difference]: Without dead ends: 16403 [2025-01-08 22:57:35,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:35,101 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 203 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:35,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 107 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:57:35,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16403 states. [2025-01-08 22:57:35,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16403 to 16401. [2025-01-08 22:57:35,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16401 states, 16400 states have (on average 1.2645731707317074) internal successors, (20739), 16400 states have internal predecessors, (20739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:35,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16401 states to 16401 states and 20739 transitions. [2025-01-08 22:57:35,284 INFO L78 Accepts]: Start accepts. Automaton has 16401 states and 20739 transitions. Word has length 194 [2025-01-08 22:57:35,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:35,284 INFO L471 AbstractCegarLoop]: Abstraction has 16401 states and 20739 transitions. [2025-01-08 22:57:35,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:35,284 INFO L276 IsEmpty]: Start isEmpty. Operand 16401 states and 20739 transitions. [2025-01-08 22:57:35,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-08 22:57:35,297 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:35,297 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 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] [2025-01-08 22:57:35,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:57:35,297 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:35,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:35,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1878560534, now seen corresponding path program 2 times [2025-01-08 22:57:35,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:35,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080188072] [2025-01-08 22:57:35,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:57:35,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:35,327 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 195 statements into 2 equivalence classes. [2025-01-08 22:57:35,350 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 195 of 195 statements. [2025-01-08 22:57:35,350 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:57:35,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:35,597 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-08 22:57:35,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:35,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080188072] [2025-01-08 22:57:35,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080188072] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:57:35,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915365632] [2025-01-08 22:57:35,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:57:35,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:57:35,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:57:35,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:57:35,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 22:57:35,694 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 195 statements into 2 equivalence classes. [2025-01-08 22:57:35,770 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 195 of 195 statements. [2025-01-08 22:57:35,770 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:57:35,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:35,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:57:35,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:57:35,964 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-08 22:57:35,965 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:57:35,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915365632] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:35,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:57:35,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:57:35,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305163027] [2025-01-08 22:57:35,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:35,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:35,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:35,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:35,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:57:35,966 INFO L87 Difference]: Start difference. First operand 16401 states and 20739 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:36,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:36,713 INFO L93 Difference]: Finished difference Result 48658 states and 61536 transitions. [2025-01-08 22:57:36,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:36,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 195 [2025-01-08 22:57:36,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:36,761 INFO L225 Difference]: With dead ends: 48658 [2025-01-08 22:57:36,761 INFO L226 Difference]: Without dead ends: 32259 [2025-01-08 22:57:36,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:57:36,781 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 75 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:36,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 377 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:57:36,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32259 states. [2025-01-08 22:57:37,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32259 to 32235. [2025-01-08 22:57:37,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32235 states, 32234 states have (on average 1.16830055221195) internal successors, (37659), 32234 states have internal predecessors, (37659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32235 states to 32235 states and 37659 transitions. [2025-01-08 22:57:37,255 INFO L78 Accepts]: Start accepts. Automaton has 32235 states and 37659 transitions. Word has length 195 [2025-01-08 22:57:37,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:37,256 INFO L471 AbstractCegarLoop]: Abstraction has 32235 states and 37659 transitions. [2025-01-08 22:57:37,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:37,256 INFO L276 IsEmpty]: Start isEmpty. Operand 32235 states and 37659 transitions. [2025-01-08 22:57:37,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-08 22:57:37,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:37,279 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:57:37,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 22:57:37,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-08 22:57:37,480 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:37,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:37,481 INFO L85 PathProgramCache]: Analyzing trace with hash -2124608982, now seen corresponding path program 1 times [2025-01-08 22:57:37,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:37,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933422402] [2025-01-08 22:57:37,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:37,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:37,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-08 22:57:37,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-08 22:57:37,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:37,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:37,745 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-08 22:57:37,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:37,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933422402] [2025-01-08 22:57:37,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933422402] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:37,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:37,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:57:37,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722441068] [2025-01-08 22:57:37,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:37,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:37,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:37,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:37,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:37,748 INFO L87 Difference]: Start difference. First operand 32235 states and 37659 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:38,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:38,508 INFO L93 Difference]: Finished difference Result 76648 states and 90975 transitions. [2025-01-08 22:57:38,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:38,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2025-01-08 22:57:38,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:38,616 INFO L225 Difference]: With dead ends: 76648 [2025-01-08 22:57:38,616 INFO L226 Difference]: Without dead ends: 44415 [2025-01-08 22:57:38,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:38,645 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 174 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:38,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 148 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:57:38,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44415 states. [2025-01-08 22:57:39,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44415 to 44415. [2025-01-08 22:57:39,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44415 states, 44414 states have (on average 1.1410140946548386) internal successors, (50677), 44414 states have internal predecessors, (50677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44415 states to 44415 states and 50677 transitions. [2025-01-08 22:57:39,195 INFO L78 Accepts]: Start accepts. Automaton has 44415 states and 50677 transitions. Word has length 195 [2025-01-08 22:57:39,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:39,195 INFO L471 AbstractCegarLoop]: Abstraction has 44415 states and 50677 transitions. [2025-01-08 22:57:39,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:39,196 INFO L276 IsEmpty]: Start isEmpty. Operand 44415 states and 50677 transitions. [2025-01-08 22:57:39,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-01-08 22:57:39,216 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:39,216 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:57:39,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 22:57:39,216 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:39,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:39,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1315161498, now seen corresponding path program 1 times [2025-01-08 22:57:39,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:39,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362228763] [2025-01-08 22:57:39,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:39,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:39,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-01-08 22:57:39,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-01-08 22:57:39,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:39,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:39,460 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-08 22:57:39,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:39,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362228763] [2025-01-08 22:57:39,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362228763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:39,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:39,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:57:39,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126779069] [2025-01-08 22:57:39,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:39,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:39,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:39,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:39,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:39,462 INFO L87 Difference]: Start difference. First operand 44415 states and 50677 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:40,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:40,396 INFO L93 Difference]: Finished difference Result 117936 states and 134991 transitions. [2025-01-08 22:57:40,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:40,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 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 232 [2025-01-08 22:57:40,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:40,501 INFO L225 Difference]: With dead ends: 117936 [2025-01-08 22:57:40,501 INFO L226 Difference]: Without dead ends: 73523 [2025-01-08 22:57:40,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:40,546 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 154 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:40,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 197 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:57:40,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73523 states. [2025-01-08 22:57:41,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73523 to 57017. [2025-01-08 22:57:41,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57017 states, 57016 states have (on average 1.1498351339974744) internal successors, (65559), 57016 states have internal predecessors, (65559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:41,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57017 states to 57017 states and 65559 transitions. [2025-01-08 22:57:41,593 INFO L78 Accepts]: Start accepts. Automaton has 57017 states and 65559 transitions. Word has length 232 [2025-01-08 22:57:41,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:41,594 INFO L471 AbstractCegarLoop]: Abstraction has 57017 states and 65559 transitions. [2025-01-08 22:57:41,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:41,594 INFO L276 IsEmpty]: Start isEmpty. Operand 57017 states and 65559 transitions. [2025-01-08 22:57:41,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-01-08 22:57:41,616 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:41,616 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:57:41,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 22:57:41,616 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:41,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:41,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1893467312, now seen corresponding path program 1 times [2025-01-08 22:57:41,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:41,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076280842] [2025-01-08 22:57:41,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:41,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:41,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-01-08 22:57:41,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-01-08 22:57:41,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:41,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:41,981 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-08 22:57:41,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:41,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076280842] [2025-01-08 22:57:41,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076280842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:41,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:41,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:57:41,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097750258] [2025-01-08 22:57:41,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:41,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:57:41,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:41,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:57:41,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:57:41,984 INFO L87 Difference]: Start difference. First operand 57017 states and 65559 transitions. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:42,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:42,884 INFO L93 Difference]: Finished difference Result 114032 states and 131116 transitions. [2025-01-08 22:57:42,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:57:42,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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 245 [2025-01-08 22:57:42,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:42,955 INFO L225 Difference]: With dead ends: 114032 [2025-01-08 22:57:42,956 INFO L226 Difference]: Without dead ends: 57017 [2025-01-08 22:57:42,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:57:42,995 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 439 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:42,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 52 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:57:43,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57017 states. [2025-01-08 22:57:43,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57017 to 54581. [2025-01-08 22:57:43,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54581 states, 54580 states have (on average 1.145602784902895) internal successors, (62527), 54580 states have internal predecessors, (62527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54581 states to 54581 states and 62527 transitions. [2025-01-08 22:57:43,740 INFO L78 Accepts]: Start accepts. Automaton has 54581 states and 62527 transitions. Word has length 245 [2025-01-08 22:57:43,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:43,741 INFO L471 AbstractCegarLoop]: Abstraction has 54581 states and 62527 transitions. [2025-01-08 22:57:43,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:43,741 INFO L276 IsEmpty]: Start isEmpty. Operand 54581 states and 62527 transitions. [2025-01-08 22:57:43,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-01-08 22:57:43,762 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:43,762 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:57:43,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 22:57:43,762 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:43,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:43,763 INFO L85 PathProgramCache]: Analyzing trace with hash 93101188, now seen corresponding path program 1 times [2025-01-08 22:57:43,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:43,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312570003] [2025-01-08 22:57:43,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:43,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:43,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-01-08 22:57:43,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-01-08 22:57:43,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:43,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:44,205 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 112 proven. 6 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2025-01-08 22:57:44,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:44,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312570003] [2025-01-08 22:57:44,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312570003] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:57:44,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588796005] [2025-01-08 22:57:44,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:44,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:57:44,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:57:44,212 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:57:44,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 22:57:44,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-01-08 22:57:44,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-01-08 22:57:44,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:44,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:44,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:57:44,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:57:44,525 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-08 22:57:44,525 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:57:44,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588796005] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:44,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:57:44,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:57:44,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137767260] [2025-01-08 22:57:44,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:44,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:44,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:44,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:44,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:57:44,527 INFO L87 Difference]: Start difference. First operand 54581 states and 62527 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:45,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:45,293 INFO L93 Difference]: Finished difference Result 157145 states and 180100 transitions. [2025-01-08 22:57:45,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:45,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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 280 [2025-01-08 22:57:45,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:45,419 INFO L225 Difference]: With dead ends: 157145 [2025-01-08 22:57:45,419 INFO L226 Difference]: Without dead ends: 102566 [2025-01-08 22:57:45,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:57:45,449 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 224 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:45,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 808 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:57:45,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102566 states. [2025-01-08 22:57:46,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102566 to 102560. [2025-01-08 22:57:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102560 states, 102559 states have (on average 1.129086672061935) internal successors, (115798), 102559 states have internal predecessors, (115798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:46,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102560 states to 102560 states and 115798 transitions. [2025-01-08 22:57:46,956 INFO L78 Accepts]: Start accepts. Automaton has 102560 states and 115798 transitions. Word has length 280 [2025-01-08 22:57:46,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:46,956 INFO L471 AbstractCegarLoop]: Abstraction has 102560 states and 115798 transitions. [2025-01-08 22:57:46,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:46,957 INFO L276 IsEmpty]: Start isEmpty. Operand 102560 states and 115798 transitions. [2025-01-08 22:57:46,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-01-08 22:57:46,981 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:46,981 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:57:46,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 22:57:47,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-08 22:57:47,181 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:47,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:47,182 INFO L85 PathProgramCache]: Analyzing trace with hash 816192664, now seen corresponding path program 1 times [2025-01-08 22:57:47,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:47,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746821234] [2025-01-08 22:57:47,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:47,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:47,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-01-08 22:57:47,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-01-08 22:57:47,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:47,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:47,463 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:57:47,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:47,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746821234] [2025-01-08 22:57:47,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746821234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:47,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:47,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:57:47,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965477074] [2025-01-08 22:57:47,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:47,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:47,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:47,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:47,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:47,465 INFO L87 Difference]: Start difference. First operand 102560 states and 115798 transitions. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:48,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:48,506 INFO L93 Difference]: Finished difference Result 204124 states and 230407 transitions. [2025-01-08 22:57:48,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:48,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 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 281 [2025-01-08 22:57:48,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:48,634 INFO L225 Difference]: With dead ends: 204124 [2025-01-08 22:57:48,634 INFO L226 Difference]: Without dead ends: 101566 [2025-01-08 22:57:48,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:48,699 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 255 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:48,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 291 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:57:48,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101566 states. [2025-01-08 22:57:50,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101566 to 99910. [2025-01-08 22:57:50,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99910 states, 99909 states have (on average 1.1200992903542224) internal successors, (111908), 99909 states have internal predecessors, (111908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:50,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99910 states to 99910 states and 111908 transitions. [2025-01-08 22:57:50,242 INFO L78 Accepts]: Start accepts. Automaton has 99910 states and 111908 transitions. Word has length 281 [2025-01-08 22:57:50,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:50,243 INFO L471 AbstractCegarLoop]: Abstraction has 99910 states and 111908 transitions. [2025-01-08 22:57:50,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:50,243 INFO L276 IsEmpty]: Start isEmpty. Operand 99910 states and 111908 transitions. [2025-01-08 22:57:50,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-01-08 22:57:50,269 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:50,270 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 22:57:50,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 22:57:50,270 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:50,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:50,270 INFO L85 PathProgramCache]: Analyzing trace with hash -433826995, now seen corresponding path program 1 times [2025-01-08 22:57:50,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:50,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240043310] [2025-01-08 22:57:50,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:50,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:50,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-08 22:57:50,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-08 22:57:50,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:50,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-08 22:57:50,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:50,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240043310] [2025-01-08 22:57:50,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240043310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:50,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:50,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:57:50,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560665122] [2025-01-08 22:57:50,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:50,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:57:50,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:50,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:57:50,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:57:50,776 INFO L87 Difference]: Start difference. First operand 99910 states and 111908 transitions. Second operand has 4 states, 4 states have (on average 72.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:52,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:52,298 INFO L93 Difference]: Finished difference Result 294394 states and 329833 transitions. [2025-01-08 22:57:52,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:57:52,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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 295 [2025-01-08 22:57:52,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:52,562 INFO L225 Difference]: With dead ends: 294394 [2025-01-08 22:57:52,562 INFO L226 Difference]: Without dead ends: 194486 [2025-01-08 22:57:52,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:57:52,655 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 700 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:52,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 50 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:57:52,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194486 states. [2025-01-08 22:57:54,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194486 to 145260. [2025-01-08 22:57:54,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145260 states, 145259 states have (on average 1.1205570739162463) internal successors, (162771), 145259 states have internal predecessors, (162771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:54,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145260 states to 145260 states and 162771 transitions. [2025-01-08 22:57:54,985 INFO L78 Accepts]: Start accepts. Automaton has 145260 states and 162771 transitions. Word has length 295 [2025-01-08 22:57:54,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:54,985 INFO L471 AbstractCegarLoop]: Abstraction has 145260 states and 162771 transitions. [2025-01-08 22:57:54,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:54,986 INFO L276 IsEmpty]: Start isEmpty. Operand 145260 states and 162771 transitions. [2025-01-08 22:57:55,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-01-08 22:57:55,009 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:55,010 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 22:57:55,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 22:57:55,010 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:55,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:55,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1343895943, now seen corresponding path program 1 times [2025-01-08 22:57:55,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:55,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292542865] [2025-01-08 22:57:55,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:55,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:55,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-01-08 22:57:55,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-01-08 22:57:55,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:55,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-08 22:57:55,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:55,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292542865] [2025-01-08 22:57:55,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292542865] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:55,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:55,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:57:55,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678186550] [2025-01-08 22:57:55,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:55,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:55,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:55,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:55,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:55,541 INFO L87 Difference]: Start difference. First operand 145260 states and 162771 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:56,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:56,843 INFO L93 Difference]: Finished difference Result 301299 states and 337388 transitions. [2025-01-08 22:57:56,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:56,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 306 [2025-01-08 22:57:56,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:57,059 INFO L225 Difference]: With dead ends: 301299 [2025-01-08 22:57:57,059 INFO L226 Difference]: Without dead ends: 156041 [2025-01-08 22:57:57,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:57,156 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 151 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:57,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 361 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:57:57,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156041 states. [2025-01-08 22:57:59,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156041 to 156034. [2025-01-08 22:57:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156034 states, 156033 states have (on average 1.1125979760691649) internal successors, (173602), 156033 states have internal predecessors, (173602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:59,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156034 states to 156034 states and 173602 transitions. [2025-01-08 22:57:59,588 INFO L78 Accepts]: Start accepts. Automaton has 156034 states and 173602 transitions. Word has length 306 [2025-01-08 22:57:59,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:59,589 INFO L471 AbstractCegarLoop]: Abstraction has 156034 states and 173602 transitions. [2025-01-08 22:57:59,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:57:59,589 INFO L276 IsEmpty]: Start isEmpty. Operand 156034 states and 173602 transitions. [2025-01-08 22:57:59,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-08 22:57:59,610 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:59,610 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:57:59,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 22:57:59,611 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:59,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:59,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1400695994, now seen corresponding path program 1 times [2025-01-08 22:57:59,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:59,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106407877] [2025-01-08 22:57:59,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:59,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:59,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-08 22:57:59,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-08 22:57:59,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:59,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:59,830 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-01-08 22:57:59,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:59,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106407877] [2025-01-08 22:57:59,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106407877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:59,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:59,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:57:59,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640316842] [2025-01-08 22:57:59,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:59,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:59,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:59,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:59,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:57:59,831 INFO L87 Difference]: Start difference. First operand 156034 states and 173602 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:58:01,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:01,842 INFO L93 Difference]: Finished difference Result 459534 states and 511728 transitions. [2025-01-08 22:58:01,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:58:01,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 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 308 [2025-01-08 22:58:01,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:02,285 INFO L225 Difference]: With dead ends: 459534 [2025-01-08 22:58:02,285 INFO L226 Difference]: Without dead ends: 303502 [2025-01-08 22:58:02,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:02,391 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 211 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:02,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 525 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:58:02,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303502 states. [2025-01-08 22:58:05,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303502 to 303484. [2025-01-08 22:58:06,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303484 states, 303483 states have (on average 1.113558255322374) internal successors, (337946), 303483 states have internal predecessors, (337946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:58:06,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303484 states to 303484 states and 337946 transitions. [2025-01-08 22:58:06,469 INFO L78 Accepts]: Start accepts. Automaton has 303484 states and 337946 transitions. Word has length 308 [2025-01-08 22:58:06,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:58:06,469 INFO L471 AbstractCegarLoop]: Abstraction has 303484 states and 337946 transitions. [2025-01-08 22:58:06,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:58:06,469 INFO L276 IsEmpty]: Start isEmpty. Operand 303484 states and 337946 transitions. [2025-01-08 22:58:06,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-01-08 22:58:06,495 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:58:06,495 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:58:06,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-08 22:58:06,496 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:58:06,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:58:06,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1858873744, now seen corresponding path program 1 times [2025-01-08 22:58:06,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:58:06,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805245147] [2025-01-08 22:58:06,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:58:06,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:58:06,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-01-08 22:58:06,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-01-08 22:58:06,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:58:06,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:58:07,063 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-01-08 22:58:07,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:58:07,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805245147] [2025-01-08 22:58:07,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805245147] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:58:07,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:58:07,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:58:07,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176033071] [2025-01-08 22:58:07,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:58:07,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:58:07,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:58:07,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:58:07,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:07,066 INFO L87 Difference]: Start difference. First operand 303484 states and 337946 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:58:09,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:58:09,967 INFO L93 Difference]: Finished difference Result 681472 states and 759469 transitions. [2025-01-08 22:58:09,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:58:09,968 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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 311 [2025-01-08 22:58:09,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:58:10,448 INFO L225 Difference]: With dead ends: 681472 [2025-01-08 22:58:10,448 INFO L226 Difference]: Without dead ends: 367434 [2025-01-08 22:58:10,543 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:58:10,544 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 167 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:58:10,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 336 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:58:10,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367434 states.