./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a893901067ae0432c16558f2b07e02825c27620f081523bfcd6a7f18ed4dc7d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:51:39,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:51:39,550 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:51:39,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:51:39,554 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:51:39,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:51:39,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:51:39,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:51:39,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:51:39,574 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:51:39,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:51:39,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:51:39,574 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:51:39,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:51:39,574 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:51:39,574 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:51:39,574 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:51:39,575 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:51:39,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:51:39,575 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:51:39,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:51:39,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:51:39,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:51:39,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:51:39,575 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:51:39,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:51:39,575 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:51:39,575 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:51:39,575 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:51:39,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:51:39,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:51:39,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:51:39,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:51:39,578 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:51:39,578 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:51:39,578 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:51:39,578 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:51:39,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:51:39,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:51:39,578 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:51:39,578 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:51:39,578 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:51:39,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:51:39,578 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2a893901067ae0432c16558f2b07e02825c27620f081523bfcd6a7f18ed4dc7d [2025-03-03 20:51:39,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:51:39,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:51:39,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:51:39,806 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:51:39,806 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:51:39,807 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-4.i [2025-03-03 20:51:40,916 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98c5c51d4/7ce262a7e5444cc2b881af6daf484043/FLAGd9542b1b4 [2025-03-03 20:51:41,156 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:51:41,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-4.i [2025-03-03 20:51:41,163 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98c5c51d4/7ce262a7e5444cc2b881af6daf484043/FLAGd9542b1b4 [2025-03-03 20:51:41,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98c5c51d4/7ce262a7e5444cc2b881af6daf484043 [2025-03-03 20:51:41,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:51:41,491 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:51:41,492 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:51:41,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:51:41,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:51:41,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:51:41" (1/1) ... [2025-03-03 20:51:41,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79a48582 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:41, skipping insertion in model container [2025-03-03 20:51:41,498 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:51:41" (1/1) ... [2025-03-03 20:51:41,511 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:51:41,613 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-4.i[918,931] [2025-03-03 20:51:41,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:51:41,702 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:51:41,711 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-4.i[918,931] [2025-03-03 20:51:41,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:51:41,764 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:51:41,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:41 WrapperNode [2025-03-03 20:51:41,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:51:41,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:51:41,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:51:41,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:51:41,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:41" (1/1) ... [2025-03-03 20:51:41,780 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:41" (1/1) ... [2025-03-03 20:51:41,808 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 230 [2025-03-03 20:51:41,808 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:51:41,809 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:51:41,809 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:51:41,809 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:51:41,818 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:41" (1/1) ... [2025-03-03 20:51:41,818 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:41" (1/1) ... [2025-03-03 20:51:41,820 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:41" (1/1) ... [2025-03-03 20:51:41,836 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:51:41,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:41" (1/1) ... [2025-03-03 20:51:41,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:41" (1/1) ... [2025-03-03 20:51:41,842 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:41" (1/1) ... [2025-03-03 20:51:41,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:41" (1/1) ... [2025-03-03 20:51:41,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:41" (1/1) ... [2025-03-03 20:51:41,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:41" (1/1) ... [2025-03-03 20:51:41,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:51:41,849 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:51:41,849 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:51:41,850 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:51:41,850 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:41" (1/1) ... [2025-03-03 20:51:41,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:51:41,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:51:41,874 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:51:41,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:51:41,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:51:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:51:41,894 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:51:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:51:41,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:51:41,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:51:41,952 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:51:41,954 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:51:42,271 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 20:51:42,271 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:51:42,285 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:51:42,285 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:51:42,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:51:42 BoogieIcfgContainer [2025-03-03 20:51:42,286 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:51:42,287 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:51:42,287 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:51:42,290 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:51:42,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:51:41" (1/3) ... [2025-03-03 20:51:42,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f432fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:51:42, skipping insertion in model container [2025-03-03 20:51:42,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:51:41" (2/3) ... [2025-03-03 20:51:42,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f432fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:51:42, skipping insertion in model container [2025-03-03 20:51:42,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:51:42" (3/3) ... [2025-03-03 20:51:42,291 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-4.i [2025-03-03 20:51:42,301 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:51:42,304 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-4.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:51:42,349 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:51:42,358 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;@28ddcf81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:51:42,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:51:42,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 64 states have (on average 1.453125) internal successors, (93), 65 states have internal predecessors, (93), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 20:51:42,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-03 20:51:42,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:51:42,375 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:51:42,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:51:42,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:51:42,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1011528688, now seen corresponding path program 1 times [2025-03-03 20:51:42,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:51:42,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967868832] [2025-03-03 20:51:42,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:51:42,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:51:42,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 20:51:42,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 20:51:42,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:51:42,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:51:42,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:51:42,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:51:42,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967868832] [2025-03-03 20:51:42,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967868832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:51:42,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:51:42,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 20:51:42,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163068664] [2025-03-03 20:51:42,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:51:42,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:51:42,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:51:42,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:51:42,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:51:42,794 INFO L87 Difference]: Start difference. First operand has 101 states, 64 states have (on average 1.453125) internal successors, (93), 65 states have internal predecessors, (93), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:51:42,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:51:42,822 INFO L93 Difference]: Finished difference Result 196 states and 351 transitions. [2025-03-03 20:51:42,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:51:42,824 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2025-03-03 20:51:42,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:51:42,832 INFO L225 Difference]: With dead ends: 196 [2025-03-03 20:51:42,834 INFO L226 Difference]: Without dead ends: 98 [2025-03-03 20:51:42,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:51:42,840 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:51:42,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:51:42,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-03 20:51:42,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-03 20:51:42,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 62 states have (on average 1.403225806451613) internal successors, (87), 62 states have internal predecessors, (87), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-03 20:51:42,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 155 transitions. [2025-03-03 20:51:42,876 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 155 transitions. Word has length 215 [2025-03-03 20:51:42,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:51:42,877 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 155 transitions. [2025-03-03 20:51:42,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:51:42,877 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 155 transitions. [2025-03-03 20:51:42,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-03-03 20:51:42,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:51:42,880 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:51:42,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 20:51:42,880 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:51:42,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:51:42,881 INFO L85 PathProgramCache]: Analyzing trace with hash 289291119, now seen corresponding path program 1 times [2025-03-03 20:51:42,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:51:42,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618679875] [2025-03-03 20:51:42,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:51:42,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:51:42,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-03 20:51:42,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-03 20:51:42,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:51:42,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:51:43,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:51:43,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:51:43,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618679875] [2025-03-03 20:51:43,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618679875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:51:43,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:51:43,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:51:43,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046141677] [2025-03-03 20:51:43,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:51:43,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:51:43,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:51:43,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:51:43,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:51:43,324 INFO L87 Difference]: Start difference. First operand 98 states and 155 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:51:43,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:51:43,418 INFO L93 Difference]: Finished difference Result 288 states and 459 transitions. [2025-03-03 20:51:43,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:51:43,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216 [2025-03-03 20:51:43,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:51:43,422 INFO L225 Difference]: With dead ends: 288 [2025-03-03 20:51:43,422 INFO L226 Difference]: Without dead ends: 193 [2025-03-03 20:51:43,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:51:43,424 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 79 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:51:43,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 287 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:51:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-03 20:51:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2025-03-03 20:51:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 119 states have (on average 1.403361344537815) internal successors, (167), 119 states have internal predecessors, (167), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 20:51:43,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 303 transitions. [2025-03-03 20:51:43,461 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 303 transitions. Word has length 216 [2025-03-03 20:51:43,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:51:43,462 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 303 transitions. [2025-03-03 20:51:43,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:51:43,463 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 303 transitions. [2025-03-03 20:51:43,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-03 20:51:43,465 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:51:43,465 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:51:43,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:51:43,466 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:51:43,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:51:43,466 INFO L85 PathProgramCache]: Analyzing trace with hash 526022704, now seen corresponding path program 1 times [2025-03-03 20:51:43,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:51:43,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043763841] [2025-03-03 20:51:43,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:51:43,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:51:43,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 20:51:43,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 20:51:43,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:51:43,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:51:43,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:51:43,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:51:43,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043763841] [2025-03-03 20:51:43,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043763841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:51:43,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:51:43,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:51:43,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008358963] [2025-03-03 20:51:43,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:51:43,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:51:43,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:51:43,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:51:43,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:51:43,638 INFO L87 Difference]: Start difference. First operand 190 states and 303 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:51:43,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:51:43,681 INFO L93 Difference]: Finished difference Result 369 states and 583 transitions. [2025-03-03 20:51:43,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:51:43,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 217 [2025-03-03 20:51:43,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:51:43,684 INFO L225 Difference]: With dead ends: 369 [2025-03-03 20:51:43,684 INFO L226 Difference]: Without dead ends: 274 [2025-03-03 20:51:43,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:51:43,685 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 59 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:51:43,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 295 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:51:43,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-03 20:51:43,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 270. [2025-03-03 20:51:43,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 193 states have (on average 1.461139896373057) internal successors, (282), 195 states have internal predecessors, (282), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 20:51:43,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 426 transitions. [2025-03-03 20:51:43,725 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 426 transitions. Word has length 217 [2025-03-03 20:51:43,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:51:43,726 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 426 transitions. [2025-03-03 20:51:43,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:51:43,726 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 426 transitions. [2025-03-03 20:51:43,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-03 20:51:43,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:51:43,730 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:51:43,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:51:43,730 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:51:43,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:51:43,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1697886186, now seen corresponding path program 1 times [2025-03-03 20:51:43,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:51:43,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079275991] [2025-03-03 20:51:43,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:51:43,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:51:43,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-03 20:51:43,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-03 20:51:43,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:51:43,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:51:44,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:51:44,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:51:44,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079275991] [2025-03-03 20:51:44,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079275991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:51:44,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:51:44,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:51:44,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357445839] [2025-03-03 20:51:44,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:51:44,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:51:44,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:51:44,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:51:44,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:51:44,573 INFO L87 Difference]: Start difference. First operand 270 states and 426 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:51:44,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:51:44,693 INFO L93 Difference]: Finished difference Result 766 states and 1209 transitions. [2025-03-03 20:51:44,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:51:44,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 217 [2025-03-03 20:51:44,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:51:44,701 INFO L225 Difference]: With dead ends: 766 [2025-03-03 20:51:44,701 INFO L226 Difference]: Without dead ends: 499 [2025-03-03 20:51:44,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:51:44,705 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 85 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:51:44,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 546 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:51:44,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2025-03-03 20:51:44,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 327. [2025-03-03 20:51:44,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 250 states have (on average 1.44) internal successors, (360), 252 states have internal predecessors, (360), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 20:51:44,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 504 transitions. [2025-03-03 20:51:44,742 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 504 transitions. Word has length 217 [2025-03-03 20:51:44,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:51:44,743 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 504 transitions. [2025-03-03 20:51:44,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:51:44,743 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 504 transitions. [2025-03-03 20:51:44,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 20:51:44,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:51:44,745 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:51:44,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:51:44,745 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:51:44,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:51:44,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1179559669, now seen corresponding path program 1 times [2025-03-03 20:51:44,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:51:44,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966219011] [2025-03-03 20:51:44,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:51:44,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:51:44,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 20:51:44,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 20:51:44,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:51:44,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:51:50,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:51:50,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:51:50,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966219011] [2025-03-03 20:51:50,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966219011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:51:50,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:51:50,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 20:51:50,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317931226] [2025-03-03 20:51:50,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:51:50,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 20:51:50,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:51:50,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 20:51:50,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:51:50,160 INFO L87 Difference]: Start difference. First operand 327 states and 504 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:51:51,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:51:51,397 INFO L93 Difference]: Finished difference Result 945 states and 1455 transitions. [2025-03-03 20:51:51,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 20:51:51,398 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 218 [2025-03-03 20:51:51,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:51:51,403 INFO L225 Difference]: With dead ends: 945 [2025-03-03 20:51:51,405 INFO L226 Difference]: Without dead ends: 621 [2025-03-03 20:51:51,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:51:51,407 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 443 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:51:51,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 743 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 20:51:51,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-03-03 20:51:51,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 426. [2025-03-03 20:51:51,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 313 states have (on average 1.415335463258786) internal successors, (443), 315 states have internal predecessors, (443), 106 states have call successors, (106), 6 states have call predecessors, (106), 6 states have return successors, (106), 104 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-03 20:51:51,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 655 transitions. [2025-03-03 20:51:51,452 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 655 transitions. Word has length 218 [2025-03-03 20:51:51,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:51:51,454 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 655 transitions. [2025-03-03 20:51:51,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:51:51,454 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 655 transitions. [2025-03-03 20:51:51,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 20:51:51,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:51:51,457 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:51:51,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:51:51,457 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:51:51,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:51:51,458 INFO L85 PathProgramCache]: Analyzing trace with hash -403001303, now seen corresponding path program 1 times [2025-03-03 20:51:51,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:51:51,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653741134] [2025-03-03 20:51:51,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:51:51,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:51:51,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 20:51:51,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 20:51:51,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:51:51,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:51:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:51:51,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:51:51,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653741134] [2025-03-03 20:51:51,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653741134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:51:51,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:51:51,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:51:51,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185354749] [2025-03-03 20:51:51,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:51:51,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:51:51,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:51:51,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:51:51,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:51:51,682 INFO L87 Difference]: Start difference. First operand 426 states and 655 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:51:51,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:51:51,952 INFO L93 Difference]: Finished difference Result 1059 states and 1653 transitions. [2025-03-03 20:51:51,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:51:51,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 218 [2025-03-03 20:51:51,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:51:51,956 INFO L225 Difference]: With dead ends: 1059 [2025-03-03 20:51:51,956 INFO L226 Difference]: Without dead ends: 735 [2025-03-03 20:51:51,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:51:51,959 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 221 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:51:51,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 494 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:51:51,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-03-03 20:51:52,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 658. [2025-03-03 20:51:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 469 states have (on average 1.4093816631130065) internal successors, (661), 473 states have internal predecessors, (661), 178 states have call successors, (178), 10 states have call predecessors, (178), 10 states have return successors, (178), 174 states have call predecessors, (178), 178 states have call successors, (178) [2025-03-03 20:51:52,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1017 transitions. [2025-03-03 20:51:52,035 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1017 transitions. Word has length 218 [2025-03-03 20:51:52,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:51:52,036 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 1017 transitions. [2025-03-03 20:51:52,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:51:52,036 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1017 transitions. [2025-03-03 20:51:52,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-03 20:51:52,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:51:52,039 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:51:52,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:51:52,039 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:51:52,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:51:52,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1247473174, now seen corresponding path program 1 times [2025-03-03 20:51:52,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:51:52,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011280113] [2025-03-03 20:51:52,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:51:52,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:51:52,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 20:51:52,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 20:51:52,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:51:52,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:51:52,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 24 proven. 75 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-03 20:51:52,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:51:52,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011280113] [2025-03-03 20:51:52,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011280113] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:51:52,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001977105] [2025-03-03 20:51:52,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:51:52,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:51:52,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:51:52,684 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:51:52,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:51:52,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-03 20:51:52,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-03 20:51:52,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:51:52,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:51:52,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 20:51:52,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:51:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 735 proven. 18 refuted. 0 times theorem prover too weak. 1491 trivial. 0 not checked. [2025-03-03 20:51:53,524 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:51:53,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001977105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:51:53,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 20:51:53,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2025-03-03 20:51:53,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397536606] [2025-03-03 20:51:53,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 20:51:53,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 20:51:53,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:51:53,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 20:51:53,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:51:53,706 INFO L87 Difference]: Start difference. First operand 658 states and 1017 transitions. Second operand has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 4 states have call successors, (68), 3 states have call predecessors, (68), 5 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) [2025-03-03 20:51:55,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:51:55,708 INFO L93 Difference]: Finished difference Result 1747 states and 2664 transitions. [2025-03-03 20:51:55,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-03 20:51:55,708 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 4 states have call successors, (68), 3 states have call predecessors, (68), 5 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) Word has length 218 [2025-03-03 20:51:55,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:51:55,714 INFO L225 Difference]: With dead ends: 1747 [2025-03-03 20:51:55,714 INFO L226 Difference]: Without dead ends: 1165 [2025-03-03 20:51:55,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=487, Invalid=1583, Unknown=0, NotChecked=0, Total=2070 [2025-03-03 20:51:55,717 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 816 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 570 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 1853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 570 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:51:55,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1125 Invalid, 1853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [570 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 20:51:55,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2025-03-03 20:51:55,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1049. [2025-03-03 20:51:55,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 765 states have (on average 1.3869281045751634) internal successors, (1061), 774 states have internal predecessors, (1061), 260 states have call successors, (260), 23 states have call predecessors, (260), 23 states have return successors, (260), 251 states have call predecessors, (260), 260 states have call successors, (260) [2025-03-03 20:51:55,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1581 transitions. [2025-03-03 20:51:55,795 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1581 transitions. Word has length 218 [2025-03-03 20:51:55,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:51:55,795 INFO L471 AbstractCegarLoop]: Abstraction has 1049 states and 1581 transitions. [2025-03-03 20:51:55,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 4 states have call successors, (68), 3 states have call predecessors, (68), 5 states have return successors, (68), 4 states have call predecessors, (68), 4 states have call successors, (68) [2025-03-03 20:51:55,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1581 transitions. [2025-03-03 20:51:55,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 20:51:55,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:51:55,797 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:51:55,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 20:51:55,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:51:55,998 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:51:55,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:51:55,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1601149361, now seen corresponding path program 1 times [2025-03-03 20:51:55,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:51:55,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932580566] [2025-03-03 20:51:55,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:51:55,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:51:56,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 20:51:56,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 20:51:56,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:51:56,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:52:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:52:34,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:52:34,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932580566] [2025-03-03 20:52:34,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932580566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:52:34,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:52:34,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 20:52:34,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672349162] [2025-03-03 20:52:34,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:52:34,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 20:52:34,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:52:34,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 20:52:34,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-03 20:52:34,383 INFO L87 Difference]: Start difference. First operand 1049 states and 1581 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:52:50,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-03 20:53:04,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:53:04,999 INFO L93 Difference]: Finished difference Result 1631 states and 2475 transitions. [2025-03-03 20:53:05,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 20:53:05,000 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-03-03 20:53:05,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:53:05,009 INFO L225 Difference]: With dead ends: 1631 [2025-03-03 20:53:05,010 INFO L226 Difference]: Without dead ends: 1629 [2025-03-03 20:53:05,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 29.5s TimeCoverageRelationStatistics Valid=181, Invalid=630, Unknown=1, NotChecked=0, Total=812 [2025-03-03 20:53:05,011 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 650 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:53:05,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 1083 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2025-03-03 20:53:05,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1629 states. [2025-03-03 20:53:05,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1629 to 1077. [2025-03-03 20:53:05,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 793 states have (on average 1.394703656998739) internal successors, (1106), 802 states have internal predecessors, (1106), 260 states have call successors, (260), 23 states have call predecessors, (260), 23 states have return successors, (260), 251 states have call predecessors, (260), 260 states have call successors, (260) [2025-03-03 20:53:05,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1626 transitions. [2025-03-03 20:53:05,088 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1626 transitions. Word has length 219 [2025-03-03 20:53:05,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:53:05,090 INFO L471 AbstractCegarLoop]: Abstraction has 1077 states and 1626 transitions. [2025-03-03 20:53:05,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:53:05,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1626 transitions. [2025-03-03 20:53:05,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 20:53:05,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:53:05,093 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:53:05,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:53:05,093 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:53:05,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:53:05,094 INFO L85 PathProgramCache]: Analyzing trace with hash -247839664, now seen corresponding path program 1 times [2025-03-03 20:53:05,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:53:05,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709664111] [2025-03-03 20:53:05,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:53:05,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:53:05,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 20:53:05,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 20:53:05,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:53:05,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:53:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:53:05,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:53:05,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709664111] [2025-03-03 20:53:05,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709664111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:53:05,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:53:05,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:53:05,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605383243] [2025-03-03 20:53:05,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:53:05,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:53:05,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:53:05,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:53:05,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:53:05,265 INFO L87 Difference]: Start difference. First operand 1077 states and 1626 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:53:05,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:53:05,469 INFO L93 Difference]: Finished difference Result 2078 states and 3112 transitions. [2025-03-03 20:53:05,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:53:05,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-03-03 20:53:05,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:53:05,475 INFO L225 Difference]: With dead ends: 2078 [2025-03-03 20:53:05,475 INFO L226 Difference]: Without dead ends: 1116 [2025-03-03 20:53:05,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:53:05,479 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 224 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:53:05,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 671 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:53:05,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2025-03-03 20:53:05,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 868. [2025-03-03 20:53:05,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 597 states have (on average 1.3417085427135678) internal successors, (801), 599 states have internal predecessors, (801), 246 states have call successors, (246), 24 states have call predecessors, (246), 24 states have return successors, (246), 244 states have call predecessors, (246), 246 states have call successors, (246) [2025-03-03 20:53:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1293 transitions. [2025-03-03 20:53:05,556 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1293 transitions. Word has length 219 [2025-03-03 20:53:05,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:53:05,557 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1293 transitions. [2025-03-03 20:53:05,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:53:05,557 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1293 transitions. [2025-03-03 20:53:05,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 20:53:05,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:53:05,559 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:53:05,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:53:05,559 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:53:05,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:53:05,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1460664781, now seen corresponding path program 1 times [2025-03-03 20:53:05,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:53:05,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376521860] [2025-03-03 20:53:05,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:53:05,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:53:05,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 20:53:05,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 20:53:05,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:53:05,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:53:05,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 9 proven. 90 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-03 20:53:05,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:53:05,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376521860] [2025-03-03 20:53:05,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376521860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:53:05,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223398432] [2025-03-03 20:53:05,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:53:05,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:53:05,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:53:05,768 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:53:05,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 20:53:05,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 20:53:05,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 20:53:05,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:53:05,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:53:05,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:53:05,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:53:06,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 399 proven. 90 refuted. 0 times theorem prover too weak. 1755 trivial. 0 not checked. [2025-03-03 20:53:06,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:53:06,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 9 proven. 90 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-03 20:53:06,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223398432] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:53:06,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:53:06,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 20:53:06,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5315] [2025-03-03 20:53:06,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:53:06,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:53:06,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:53:06,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:53:06,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:53:06,402 INFO L87 Difference]: Start difference. First operand 868 states and 1293 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2025-03-03 20:53:06,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:53:06,601 INFO L93 Difference]: Finished difference Result 1161 states and 1692 transitions. [2025-03-03 20:53:06,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:53:06,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) Word has length 219 [2025-03-03 20:53:06,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:53:06,604 INFO L225 Difference]: With dead ends: 1161 [2025-03-03 20:53:06,605 INFO L226 Difference]: Without dead ends: 371 [2025-03-03 20:53:06,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 435 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:53:06,608 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 114 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:53:06,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 243 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:53:06,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-03-03 20:53:06,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 328. [2025-03-03 20:53:06,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 210 states have (on average 1.223809523809524) internal successors, (257), 210 states have internal predecessors, (257), 102 states have call successors, (102), 15 states have call predecessors, (102), 15 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-03 20:53:06,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 461 transitions. [2025-03-03 20:53:06,656 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 461 transitions. Word has length 219 [2025-03-03 20:53:06,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:53:06,656 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 461 transitions. [2025-03-03 20:53:06,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 2 states have call successors, (64), 2 states have call predecessors, (64), 4 states have return successors, (65), 2 states have call predecessors, (65), 2 states have call successors, (65) [2025-03-03 20:53:06,657 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 461 transitions. [2025-03-03 20:53:06,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 20:53:06,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:53:06,658 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:53:06,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 20:53:06,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 20:53:06,859 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:53:06,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:53:06,860 INFO L85 PathProgramCache]: Analyzing trace with hash -113751566, now seen corresponding path program 1 times [2025-03-03 20:53:06,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:53:06,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657916486] [2025-03-03 20:53:06,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:53:06,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:53:06,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 20:53:06,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 20:53:06,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:53:06,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:53:07,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 3 proven. 96 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-03 20:53:07,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:53:07,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657916486] [2025-03-03 20:53:07,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657916486] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:53:07,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598309026] [2025-03-03 20:53:07,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:53:07,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:53:07,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:53:07,118 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:53:07,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 20:53:07,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 20:53:07,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 20:53:07,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:53:07,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:53:07,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 20:53:07,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:53:07,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 163 proven. 96 refuted. 0 times theorem prover too weak. 1985 trivial. 0 not checked. [2025-03-03 20:53:07,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:53:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 3 proven. 96 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-03 20:53:07,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598309026] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:53:07,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:53:07,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-03 20:53:07,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478407821] [2025-03-03 20:53:07,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:53:07,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 20:53:07,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:53:07,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 20:53:07,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:53:07,845 INFO L87 Difference]: Start difference. First operand 328 states and 461 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-03 20:53:08,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:53:08,518 INFO L93 Difference]: Finished difference Result 828 states and 1155 transitions. [2025-03-03 20:53:08,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 20:53:08,519 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) Word has length 219 [2025-03-03 20:53:08,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:53:08,524 INFO L225 Difference]: With dead ends: 828 [2025-03-03 20:53:08,524 INFO L226 Difference]: Without dead ends: 582 [2025-03-03 20:53:08,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 433 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2025-03-03 20:53:08,525 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 269 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:53:08,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 766 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:53:08,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-03-03 20:53:08,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 549. [2025-03-03 20:53:08,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 353 states have (on average 1.2152974504249292) internal successors, (429), 353 states have internal predecessors, (429), 170 states have call successors, (170), 25 states have call predecessors, (170), 25 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) [2025-03-03 20:53:08,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 769 transitions. [2025-03-03 20:53:08,575 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 769 transitions. Word has length 219 [2025-03-03 20:53:08,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:53:08,576 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 769 transitions. [2025-03-03 20:53:08,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (67), 2 states have call predecessors, (67), 2 states have call successors, (67) [2025-03-03 20:53:08,576 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 769 transitions. [2025-03-03 20:53:08,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 20:53:08,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:53:08,578 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:53:08,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 20:53:08,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:53:08,779 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:53:08,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:53:08,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1688852781, now seen corresponding path program 1 times [2025-03-03 20:53:08,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:53:08,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736789031] [2025-03-03 20:53:08,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:53:08,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:53:08,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 20:53:08,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 20:53:08,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:53:08,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:53:08,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:53:08,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:53:08,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736789031] [2025-03-03 20:53:08,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736789031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:53:08,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:53:08,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:53:08,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076388723] [2025-03-03 20:53:08,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:53:08,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:53:08,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:53:08,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:53:08,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:53:08,936 INFO L87 Difference]: Start difference. First operand 549 states and 769 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:53:09,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:53:09,078 INFO L93 Difference]: Finished difference Result 1230 states and 1725 transitions. [2025-03-03 20:53:09,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:53:09,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2025-03-03 20:53:09,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:53:09,083 INFO L225 Difference]: With dead ends: 1230 [2025-03-03 20:53:09,083 INFO L226 Difference]: Without dead ends: 763 [2025-03-03 20:53:09,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:53:09,085 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 83 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:53:09,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 279 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:53:09,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2025-03-03 20:53:09,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 761. [2025-03-03 20:53:09,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 487 states have (on average 1.2094455852156059) internal successors, (589), 487 states have internal predecessors, (589), 238 states have call successors, (238), 35 states have call predecessors, (238), 35 states have return successors, (238), 238 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-03 20:53:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1065 transitions. [2025-03-03 20:53:09,158 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1065 transitions. Word has length 219 [2025-03-03 20:53:09,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:53:09,159 INFO L471 AbstractCegarLoop]: Abstraction has 761 states and 1065 transitions. [2025-03-03 20:53:09,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:53:09,160 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1065 transitions. [2025-03-03 20:53:09,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 20:53:09,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:53:09,161 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:53:09,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:53:09,161 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:53:09,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:53:09,161 INFO L85 PathProgramCache]: Analyzing trace with hash 365962251, now seen corresponding path program 1 times [2025-03-03 20:53:09,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:53:09,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169249175] [2025-03-03 20:53:09,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:53:09,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:53:09,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 20:53:09,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 20:53:09,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:53:09,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:53:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-03 20:53:09,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:53:09,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169249175] [2025-03-03 20:53:09,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169249175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:53:09,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:53:09,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:53:09,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689846424] [2025-03-03 20:53:09,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:53:09,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:53:09,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:53:09,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:53:09,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:53:09,257 INFO L87 Difference]: Start difference. First operand 761 states and 1065 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:53:09,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:53:09,350 INFO L93 Difference]: Finished difference Result 1477 states and 2070 transitions. [2025-03-03 20:53:09,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:53:09,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 220 [2025-03-03 20:53:09,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:53:09,355 INFO L225 Difference]: With dead ends: 1477 [2025-03-03 20:53:09,356 INFO L226 Difference]: Without dead ends: 786 [2025-03-03 20:53:09,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:53:09,358 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 133 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:53:09,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 269 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:53:09,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2025-03-03 20:53:09,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 784. [2025-03-03 20:53:09,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 510 states have (on average 1.2137254901960783) internal successors, (619), 510 states have internal predecessors, (619), 238 states have call successors, (238), 35 states have call predecessors, (238), 35 states have return successors, (238), 238 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-03 20:53:09,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1095 transitions. [2025-03-03 20:53:09,427 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1095 transitions. Word has length 220 [2025-03-03 20:53:09,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:53:09,428 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1095 transitions. [2025-03-03 20:53:09,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-03 20:53:09,428 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1095 transitions. [2025-03-03 20:53:09,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 20:53:09,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:53:09,429 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:53:09,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 20:53:09,429 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:53:09,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:53:09,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1330532179, now seen corresponding path program 1 times [2025-03-03 20:53:09,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:53:09,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013892798] [2025-03-03 20:53:09,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:53:09,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:53:09,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 20:53:09,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 20:53:09,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:53:09,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:53:10,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 51 proven. 141 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked. [2025-03-03 20:53:10,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:53:10,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013892798] [2025-03-03 20:53:10,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013892798] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:53:10,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953088650] [2025-03-03 20:53:10,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:53:10,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:53:10,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:53:10,439 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:53:10,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 20:53:10,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 20:53:10,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 20:53:10,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:53:10,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:53:10,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 20:53:10,590 INFO L279 TraceCheckSpWp]: Computing forward predicates...