./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-0.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_fillercodesize_ps-cn-250_file-0.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 465302550670ddfe2aca9dabc319e04462635a8aa1413623f09c27b5df4d6427 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:43:18,828 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:43:18,877 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:43:18,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:43:18,883 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:43:18,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:43:18,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:43:18,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:43:18,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:43:18,900 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:43:18,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:43:18,901 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:43:18,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:43:18,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:43:18,901 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:43:18,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:43:18,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:43:18,901 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:43:18,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:43:18,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:43:18,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:43:18,902 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:43:18,902 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:43:18,902 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:43:18,902 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:43:18,902 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:43:18,902 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:43:18,902 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:43:18,902 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:43:18,902 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:43:18,903 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:43:18,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:43:18,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:43:18,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:43:18,904 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:43:18,904 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:43:18,904 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:43:18,904 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:43:18,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:43:18,904 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:43:18,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:43:18,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:43:18,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:43:18,904 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 -> 465302550670ddfe2aca9dabc319e04462635a8aa1413623f09c27b5df4d6427 [2025-03-03 19:43:19,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:43:19,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:43:19,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:43:19,152 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:43:19,152 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:43:19,154 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-0.i [2025-03-03 19:43:20,398 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85b0f1415/e201d06e2bf14fdeb9cad26a6f041f76/FLAG5667d3750 [2025-03-03 19:43:20,688 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:43:20,689 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-0.i [2025-03-03 19:43:20,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85b0f1415/e201d06e2bf14fdeb9cad26a6f041f76/FLAG5667d3750 [2025-03-03 19:43:20,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85b0f1415/e201d06e2bf14fdeb9cad26a6f041f76 [2025-03-03 19:43:20,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:43:20,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:43:20,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:43:20,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:43:20,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:43:20,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:43:20" (1/1) ... [2025-03-03 19:43:20,979 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d7f33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:20, skipping insertion in model container [2025-03-03 19:43:20,979 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:43:20" (1/1) ... [2025-03-03 19:43:20,998 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:43:21,115 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_fillercodesize_ps-cn-250_file-0.i[915,928] [2025-03-03 19:43:21,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:43:21,254 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:43:21,265 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_fillercodesize_ps-cn-250_file-0.i[915,928] [2025-03-03 19:43:21,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:43:21,351 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:43:21,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:21 WrapperNode [2025-03-03 19:43:21,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:43:21,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:43:21,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:43:21,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:43:21,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:21" (1/1) ... [2025-03-03 19:43:21,369 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:21" (1/1) ... [2025-03-03 19:43:21,409 INFO L138 Inliner]: procedures = 26, calls = 85, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 475 [2025-03-03 19:43:21,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:43:21,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:43:21,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:43:21,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:43:21,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:21" (1/1) ... [2025-03-03 19:43:21,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:21" (1/1) ... [2025-03-03 19:43:21,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:21" (1/1) ... [2025-03-03 19:43:21,448 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 19:43:21,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:21" (1/1) ... [2025-03-03 19:43:21,448 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:21" (1/1) ... [2025-03-03 19:43:21,469 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:21" (1/1) ... [2025-03-03 19:43:21,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:21" (1/1) ... [2025-03-03 19:43:21,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:21" (1/1) ... [2025-03-03 19:43:21,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:21" (1/1) ... [2025-03-03 19:43:21,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:43:21,495 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:43:21,495 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:43:21,495 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:43:21,496 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:21" (1/1) ... [2025-03-03 19:43:21,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:43:21,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:43:21,525 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 19:43:21,527 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 19:43:21,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:43:21,545 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:43:21,546 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:43:21,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:43:21,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:43:21,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:43:21,630 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:43:21,632 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:43:22,326 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 19:43:22,326 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:43:22,343 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:43:22,343 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:43:22,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:43:22 BoogieIcfgContainer [2025-03-03 19:43:22,344 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:43:22,346 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:43:22,346 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:43:22,350 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:43:22,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:43:20" (1/3) ... [2025-03-03 19:43:22,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aac97c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:43:22, skipping insertion in model container [2025-03-03 19:43:22,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:43:21" (2/3) ... [2025-03-03 19:43:22,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aac97c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:43:22, skipping insertion in model container [2025-03-03 19:43:22,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:43:22" (3/3) ... [2025-03-03 19:43:22,352 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-0.i [2025-03-03 19:43:22,363 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:43:22,366 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-0.i that has 2 procedures, 202 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:43:22,416 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:43:22,425 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;@5ec3ac1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:43:22,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:43:22,430 INFO L276 IsEmpty]: Start isEmpty. Operand has 202 states, 127 states have (on average 1.5196850393700787) internal successors, (193), 128 states have internal predecessors, (193), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 19:43:22,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-03-03 19:43:22,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:22,452 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:43:22,452 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:22,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:22,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1977480831, now seen corresponding path program 1 times [2025-03-03 19:43:22,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:22,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932037945] [2025-03-03 19:43:22,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:22,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:22,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-03 19:43:22,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-03 19:43:22,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:22,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:22,950 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2025-03-03 19:43:22,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:22,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932037945] [2025-03-03 19:43:22,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932037945] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:43:22,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382743139] [2025-03-03 19:43:22,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:22,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:43:22,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:43:22,954 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 19:43:22,957 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 19:43:23,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-03 19:43:23,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-03 19:43:23,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:23,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:23,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:43:23,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:43:23,283 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 10082 trivial. 0 not checked. [2025-03-03 19:43:23,283 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:43:23,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382743139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:43:23,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:43:23,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:43:23,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803578627] [2025-03-03 19:43:23,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:43:23,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:43:23,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:23,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:43:23,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:43:23,310 INFO L87 Difference]: Start difference. First operand has 202 states, 127 states have (on average 1.5196850393700787) internal successors, (193), 128 states have internal predecessors, (193), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand has 2 states, 2 states have (on average 51.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) [2025-03-03 19:43:23,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:23,371 INFO L93 Difference]: Finished difference Result 398 states and 741 transitions. [2025-03-03 19:43:23,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:43:23,375 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 51.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) Word has length 457 [2025-03-03 19:43:23,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:23,383 INFO L225 Difference]: With dead ends: 398 [2025-03-03 19:43:23,384 INFO L226 Difference]: Without dead ends: 199 [2025-03-03 19:43:23,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 458 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 19:43:23,391 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:23,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 329 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:43:23,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-03-03 19:43:23,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-03-03 19:43:23,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 125 states have (on average 1.504) internal successors, (188), 125 states have internal predecessors, (188), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 19:43:23,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 332 transitions. [2025-03-03 19:43:23,447 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 332 transitions. Word has length 457 [2025-03-03 19:43:23,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:23,448 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 332 transitions. [2025-03-03 19:43:23,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 51.0) internal successors, (102), 2 states have internal predecessors, (102), 2 states have call successors, (72), 2 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 2 states have call successors, (72) [2025-03-03 19:43:23,448 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 332 transitions. [2025-03-03 19:43:23,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-03-03 19:43:23,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:23,461 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:43:23,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:43:23,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 19:43:23,665 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:23,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:23,666 INFO L85 PathProgramCache]: Analyzing trace with hash 793905545, now seen corresponding path program 1 times [2025-03-03 19:43:23,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:23,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274773396] [2025-03-03 19:43:23,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:23,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:23,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-03 19:43:23,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-03 19:43:23,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:23,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:24,087 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-03 19:43:24,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:24,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274773396] [2025-03-03 19:43:24,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274773396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:43:24,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:43:24,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:43:24,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311831379] [2025-03-03 19:43:24,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:43:24,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:43:24,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:24,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:43:24,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:43:24,090 INFO L87 Difference]: Start difference. First operand 199 states and 332 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-03 19:43:24,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:24,165 INFO L93 Difference]: Finished difference Result 556 states and 922 transitions. [2025-03-03 19:43:24,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:43:24,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 457 [2025-03-03 19:43:24,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:24,172 INFO L225 Difference]: With dead ends: 556 [2025-03-03 19:43:24,174 INFO L226 Difference]: Without dead ends: 360 [2025-03-03 19:43:24,175 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 19:43:24,176 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 251 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:24,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 842 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:43:24,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-03 19:43:24,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 216. [2025-03-03 19:43:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 142 states have (on average 1.5422535211267605) internal successors, (219), 142 states have internal predecessors, (219), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 19:43:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 363 transitions. [2025-03-03 19:43:24,218 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 363 transitions. Word has length 457 [2025-03-03 19:43:24,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:24,222 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 363 transitions. [2025-03-03 19:43:24,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-03 19:43:24,222 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 363 transitions. [2025-03-03 19:43:24,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-03-03 19:43:24,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:24,226 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:43:24,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:43:24,226 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:24,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:24,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1216198296, now seen corresponding path program 1 times [2025-03-03 19:43:24,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:24,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066720763] [2025-03-03 19:43:24,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:24,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:24,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-03 19:43:24,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-03 19:43:24,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:24,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:24,495 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-03 19:43:24,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:24,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066720763] [2025-03-03 19:43:24,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066720763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:43:24,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:43:24,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:43:24,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395985324] [2025-03-03 19:43:24,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:43:24,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:43:24,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:24,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:43:24,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:43:24,499 INFO L87 Difference]: Start difference. First operand 216 states and 363 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-03 19:43:24,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:24,566 INFO L93 Difference]: Finished difference Result 573 states and 951 transitions. [2025-03-03 19:43:24,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:43:24,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 457 [2025-03-03 19:43:24,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:24,572 INFO L225 Difference]: With dead ends: 573 [2025-03-03 19:43:24,573 INFO L226 Difference]: Without dead ends: 360 [2025-03-03 19:43:24,574 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 19:43:24,575 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 249 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:24,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 668 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:43:24,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-03 19:43:24,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 216. [2025-03-03 19:43:24,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 142 states have (on average 1.528169014084507) internal successors, (217), 142 states have internal predecessors, (217), 72 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-03 19:43:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 361 transitions. [2025-03-03 19:43:24,599 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 361 transitions. Word has length 457 [2025-03-03 19:43:24,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:24,600 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 361 transitions. [2025-03-03 19:43:24,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-03 19:43:24,600 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 361 transitions. [2025-03-03 19:43:24,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-03-03 19:43:24,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:24,607 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:43:24,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:43:24,607 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:24,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:24,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1004847383, now seen corresponding path program 1 times [2025-03-03 19:43:24,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:24,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981937969] [2025-03-03 19:43:24,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:24,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:24,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-03 19:43:24,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-03 19:43:24,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:24,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-03 19:43:25,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:25,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981937969] [2025-03-03 19:43:25,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981937969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:43:25,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:43:25,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:43:25,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265561916] [2025-03-03 19:43:25,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:43:25,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:43:25,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:25,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:43:25,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:43:25,297 INFO L87 Difference]: Start difference. First operand 216 states and 361 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-03 19:43:25,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:25,742 INFO L93 Difference]: Finished difference Result 643 states and 1078 transitions. [2025-03-03 19:43:25,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:43:25,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 457 [2025-03-03 19:43:25,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:25,746 INFO L225 Difference]: With dead ends: 643 [2025-03-03 19:43:25,746 INFO L226 Difference]: Without dead ends: 430 [2025-03-03 19:43:25,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:43:25,748 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 262 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:25,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1133 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 19:43:25,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-03-03 19:43:25,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 413. [2025-03-03 19:43:25,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 266 states have (on average 1.5338345864661653) internal successors, (408), 266 states have internal predecessors, (408), 144 states have call successors, (144), 2 states have call predecessors, (144), 2 states have return successors, (144), 144 states have call predecessors, (144), 144 states have call successors, (144) [2025-03-03 19:43:25,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 696 transitions. [2025-03-03 19:43:25,795 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 696 transitions. Word has length 457 [2025-03-03 19:43:25,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:25,796 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 696 transitions. [2025-03-03 19:43:25,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-03 19:43:25,796 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 696 transitions. [2025-03-03 19:43:25,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-03-03 19:43:25,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:25,800 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:43:25,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:43:25,800 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:25,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:25,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1298250390, now seen corresponding path program 1 times [2025-03-03 19:43:25,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:25,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796916144] [2025-03-03 19:43:25,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:25,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:25,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-03 19:43:25,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-03 19:43:25,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:25,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:26,236 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-03 19:43:26,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:26,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796916144] [2025-03-03 19:43:26,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796916144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:43:26,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:43:26,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:43:26,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734676321] [2025-03-03 19:43:26,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:43:26,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:43:26,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:26,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:43:26,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:43:26,240 INFO L87 Difference]: Start difference. First operand 413 states and 696 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-03 19:43:26,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:26,296 INFO L93 Difference]: Finished difference Result 957 states and 1625 transitions. [2025-03-03 19:43:26,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:43:26,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 457 [2025-03-03 19:43:26,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:26,302 INFO L225 Difference]: With dead ends: 957 [2025-03-03 19:43:26,302 INFO L226 Difference]: Without dead ends: 692 [2025-03-03 19:43:26,303 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 19:43:26,304 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 189 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:26,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 713 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:43:26,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2025-03-03 19:43:26,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 690. [2025-03-03 19:43:26,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 470 states have (on average 1.5638297872340425) internal successors, (735), 470 states have internal predecessors, (735), 216 states have call successors, (216), 3 states have call predecessors, (216), 3 states have return successors, (216), 216 states have call predecessors, (216), 216 states have call successors, (216) [2025-03-03 19:43:26,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1167 transitions. [2025-03-03 19:43:26,373 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1167 transitions. Word has length 457 [2025-03-03 19:43:26,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:26,374 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 1167 transitions. [2025-03-03 19:43:26,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-03 19:43:26,374 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1167 transitions. [2025-03-03 19:43:26,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-03-03 19:43:26,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:26,379 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:43:26,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:43:26,380 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:26,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:26,383 INFO L85 PathProgramCache]: Analyzing trace with hash 402490089, now seen corresponding path program 1 times [2025-03-03 19:43:26,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:26,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099645806] [2025-03-03 19:43:26,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:26,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:26,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-03 19:43:26,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-03 19:43:26,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:26,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-03 19:43:27,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:27,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099645806] [2025-03-03 19:43:27,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099645806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:43:27,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:43:27,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:43:27,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635306081] [2025-03-03 19:43:27,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:43:27,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:43:27,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:27,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:43:27,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:43:27,126 INFO L87 Difference]: Start difference. First operand 690 states and 1167 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-03 19:43:27,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:27,450 INFO L93 Difference]: Finished difference Result 1568 states and 2630 transitions. [2025-03-03 19:43:27,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:43:27,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 457 [2025-03-03 19:43:27,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:27,457 INFO L225 Difference]: With dead ends: 1568 [2025-03-03 19:43:27,457 INFO L226 Difference]: Without dead ends: 1139 [2025-03-03 19:43:27,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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 19:43:27,459 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 307 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:27,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 966 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:43:27,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2025-03-03 19:43:27,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1111. [2025-03-03 19:43:27,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 745 states have (on average 1.5463087248322147) internal successors, (1152), 745 states have internal predecessors, (1152), 360 states have call successors, (360), 5 states have call predecessors, (360), 5 states have return successors, (360), 360 states have call predecessors, (360), 360 states have call successors, (360) [2025-03-03 19:43:27,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1872 transitions. [2025-03-03 19:43:27,572 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1872 transitions. Word has length 457 [2025-03-03 19:43:27,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:27,573 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1872 transitions. [2025-03-03 19:43:27,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-03 19:43:27,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1872 transitions. [2025-03-03 19:43:27,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-03-03 19:43:27,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:27,575 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:43:27,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:43:27,575 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:27,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:27,576 INFO L85 PathProgramCache]: Analyzing trace with hash -108044088, now seen corresponding path program 1 times [2025-03-03 19:43:27,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:27,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346685465] [2025-03-03 19:43:27,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:27,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:27,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-03 19:43:27,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-03 19:43:27,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:27,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:28,291 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-03 19:43:28,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:28,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346685465] [2025-03-03 19:43:28,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346685465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:43:28,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:43:28,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:43:28,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27857660] [2025-03-03 19:43:28,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:43:28,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:43:28,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:28,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:43:28,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:43:28,294 INFO L87 Difference]: Start difference. First operand 1111 states and 1872 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-03 19:43:29,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:29,199 INFO L93 Difference]: Finished difference Result 3250 states and 5475 transitions. [2025-03-03 19:43:29,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 19:43:29,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 457 [2025-03-03 19:43:29,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:29,216 INFO L225 Difference]: With dead ends: 3250 [2025-03-03 19:43:29,217 INFO L226 Difference]: Without dead ends: 2803 [2025-03-03 19:43:29,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:43:29,221 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 1422 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1422 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:29,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1422 Valid, 1366 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 19:43:29,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2803 states. [2025-03-03 19:43:29,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2803 to 2085. [2025-03-03 19:43:29,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2085 states, 1510 states have (on average 1.5867549668874172) internal successors, (2396), 1516 states have internal predecessors, (2396), 560 states have call successors, (560), 14 states have call predecessors, (560), 14 states have return successors, (560), 554 states have call predecessors, (560), 560 states have call successors, (560) [2025-03-03 19:43:29,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 3516 transitions. [2025-03-03 19:43:29,418 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 3516 transitions. Word has length 457 [2025-03-03 19:43:29,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:29,419 INFO L471 AbstractCegarLoop]: Abstraction has 2085 states and 3516 transitions. [2025-03-03 19:43:29,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-03 19:43:29,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 3516 transitions. [2025-03-03 19:43:29,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-03-03 19:43:29,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:29,423 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:43:29,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 19:43:29,424 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:29,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:29,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1025146505, now seen corresponding path program 1 times [2025-03-03 19:43:29,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:29,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730881776] [2025-03-03 19:43:29,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:29,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:29,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-03 19:43:29,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-03 19:43:29,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:29,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:30,371 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-03 19:43:30,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:30,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730881776] [2025-03-03 19:43:30,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730881776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:43:30,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:43:30,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 19:43:30,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531837185] [2025-03-03 19:43:30,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:43:30,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:43:30,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:30,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:43:30,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:43:30,374 INFO L87 Difference]: Start difference. First operand 2085 states and 3516 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-03 19:43:31,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:31,941 INFO L93 Difference]: Finished difference Result 8573 states and 14406 transitions. [2025-03-03 19:43:31,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:43:31,943 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 457 [2025-03-03 19:43:31,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:31,987 INFO L225 Difference]: With dead ends: 8573 [2025-03-03 19:43:31,987 INFO L226 Difference]: Without dead ends: 6865 [2025-03-03 19:43:31,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-03 19:43:31,997 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 939 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:31,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 1441 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 19:43:32,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6865 states. [2025-03-03 19:43:32,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6865 to 6169. [2025-03-03 19:43:32,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6169 states, 4821 states have (on average 1.6345156606513171) internal successors, (7880), 4843 states have internal predecessors, (7880), 1308 states have call successors, (1308), 39 states have call predecessors, (1308), 39 states have return successors, (1308), 1286 states have call predecessors, (1308), 1308 states have call successors, (1308) [2025-03-03 19:43:32,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6169 states to 6169 states and 10496 transitions. [2025-03-03 19:43:32,486 INFO L78 Accepts]: Start accepts. Automaton has 6169 states and 10496 transitions. Word has length 457 [2025-03-03 19:43:32,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:32,488 INFO L471 AbstractCegarLoop]: Abstraction has 6169 states and 10496 transitions. [2025-03-03 19:43:32,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-03 19:43:32,488 INFO L276 IsEmpty]: Start isEmpty. Operand 6169 states and 10496 transitions. [2025-03-03 19:43:32,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-03-03 19:43:32,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:32,494 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:43:32,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 19:43:32,495 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:32,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:32,496 INFO L85 PathProgramCache]: Analyzing trace with hash 28074152, now seen corresponding path program 1 times [2025-03-03 19:43:32,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:32,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372118524] [2025-03-03 19:43:32,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:32,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:32,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-03 19:43:32,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-03 19:43:32,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:32,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 51 proven. 162 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-03-03 19:43:33,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:33,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372118524] [2025-03-03 19:43:33,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372118524] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:43:33,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247730777] [2025-03-03 19:43:33,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:33,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:43:33,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:43:33,111 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 19:43:33,112 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 19:43:33,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-03-03 19:43:33,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-03-03 19:43:33,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:33,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:33,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 19:43:33,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:43:35,029 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 3786 proven. 330 refuted. 0 times theorem prover too weak. 6108 trivial. 0 not checked. [2025-03-03 19:43:35,030 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:43:35,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 90 proven. 333 refuted. 0 times theorem prover too weak. 9801 trivial. 0 not checked. [2025-03-03 19:43:35,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247730777] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:43:35,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:43:35,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 11] total 20 [2025-03-03 19:43:35,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591947084] [2025-03-03 19:43:35,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:43:35,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 19:43:35,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:35,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 19:43:35,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-03-03 19:43:35,935 INFO L87 Difference]: Start difference. First operand 6169 states and 10496 transitions. Second operand has 20 states, 20 states have (on average 9.55) internal successors, (191), 20 states have internal predecessors, (191), 4 states have call successors, (186), 3 states have call predecessors, (186), 7 states have return successors, (188), 4 states have call predecessors, (188), 4 states have call successors, (188) [2025-03-03 19:43:38,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:38,897 INFO L93 Difference]: Finished difference Result 11410 states and 18952 transitions. [2025-03-03 19:43:38,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-03 19:43:38,898 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 9.55) internal successors, (191), 20 states have internal predecessors, (191), 4 states have call successors, (186), 3 states have call predecessors, (186), 7 states have return successors, (188), 4 states have call predecessors, (188), 4 states have call successors, (188) Word has length 457 [2025-03-03 19:43:38,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:38,930 INFO L225 Difference]: With dead ends: 11410 [2025-03-03 19:43:38,930 INFO L226 Difference]: Without dead ends: 5736 [2025-03-03 19:43:38,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 965 GetRequests, 903 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=973, Invalid=2809, Unknown=0, NotChecked=0, Total=3782 [2025-03-03 19:43:38,945 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 1349 mSDsluCounter, 1426 mSDsCounter, 0 mSdLazyCounter, 2305 mSolverCounterSat, 909 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 2013 SdHoareTripleChecker+Invalid, 3214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 909 IncrementalHoareTripleChecker+Valid, 2305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:38,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 2013 Invalid, 3214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [909 Valid, 2305 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 19:43:38,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5736 states. [2025-03-03 19:43:39,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5736 to 2821. [2025-03-03 19:43:39,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2821 states, 1982 states have (on average 1.5116044399596367) internal successors, (2996), 1990 states have internal predecessors, (2996), 784 states have call successors, (784), 54 states have call predecessors, (784), 54 states have return successors, (784), 776 states have call predecessors, (784), 784 states have call successors, (784) [2025-03-03 19:43:39,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2821 states to 2821 states and 4564 transitions. [2025-03-03 19:43:39,281 INFO L78 Accepts]: Start accepts. Automaton has 2821 states and 4564 transitions. Word has length 457 [2025-03-03 19:43:39,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:39,283 INFO L471 AbstractCegarLoop]: Abstraction has 2821 states and 4564 transitions. [2025-03-03 19:43:39,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.55) internal successors, (191), 20 states have internal predecessors, (191), 4 states have call successors, (186), 3 states have call predecessors, (186), 7 states have return successors, (188), 4 states have call predecessors, (188), 4 states have call successors, (188) [2025-03-03 19:43:39,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2821 states and 4564 transitions. [2025-03-03 19:43:39,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-03 19:43:39,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:39,291 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:43:39,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 19:43:39,492 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,SelfDestructingSolverStorable8 [2025-03-03 19:43:39,493 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:39,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:39,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1778920644, now seen corresponding path program 1 times [2025-03-03 19:43:39,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:39,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579041567] [2025-03-03 19:43:39,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:39,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:39,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-03 19:43:39,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-03 19:43:39,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:39,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:39,847 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 57 proven. 156 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-03-03 19:43:39,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:39,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579041567] [2025-03-03 19:43:39,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579041567] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:43:39,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261552532] [2025-03-03 19:43:39,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:39,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:43:39,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:43:39,850 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 19:43:39,852 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 19:43:39,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-03 19:43:40,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-03 19:43:40,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:40,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:40,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 19:43:40,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:43:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 4061 proven. 156 refuted. 0 times theorem prover too weak. 6007 trivial. 0 not checked. [2025-03-03 19:43:40,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:43:41,006 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 57 proven. 156 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-03-03 19:43:41,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261552532] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:43:41,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:43:41,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 19:43:41,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063987168] [2025-03-03 19:43:41,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:43:41,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:43:41,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:41,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:43:41,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:43:41,012 INFO L87 Difference]: Start difference. First operand 2821 states and 4564 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (124), 2 states have call predecessors, (124), 4 states have return successors, (125), 2 states have call predecessors, (125), 2 states have call successors, (125) [2025-03-03 19:43:41,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:41,409 INFO L93 Difference]: Finished difference Result 5515 states and 8795 transitions. [2025-03-03 19:43:41,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 19:43:41,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (124), 2 states have call predecessors, (124), 4 states have return successors, (125), 2 states have call predecessors, (125), 2 states have call successors, (125) Word has length 459 [2025-03-03 19:43:41,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:41,458 INFO L225 Difference]: With dead ends: 5515 [2025-03-03 19:43:41,458 INFO L226 Difference]: Without dead ends: 2975 [2025-03-03 19:43:41,463 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 925 GetRequests, 915 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:43:41,464 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 149 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:41,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 589 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:43:41,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2025-03-03 19:43:41,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 2869. [2025-03-03 19:43:41,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2869 states, 2018 states have (on average 1.4905847373637264) internal successors, (3008), 2026 states have internal predecessors, (3008), 784 states have call successors, (784), 66 states have call predecessors, (784), 66 states have return successors, (784), 776 states have call predecessors, (784), 784 states have call successors, (784) [2025-03-03 19:43:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2869 states and 4576 transitions. [2025-03-03 19:43:41,783 INFO L78 Accepts]: Start accepts. Automaton has 2869 states and 4576 transitions. Word has length 459 [2025-03-03 19:43:41,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:41,784 INFO L471 AbstractCegarLoop]: Abstraction has 2869 states and 4576 transitions. [2025-03-03 19:43:41,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (124), 2 states have call predecessors, (124), 4 states have return successors, (125), 2 states have call predecessors, (125), 2 states have call successors, (125) [2025-03-03 19:43:41,784 INFO L276 IsEmpty]: Start isEmpty. Operand 2869 states and 4576 transitions. [2025-03-03 19:43:41,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-03 19:43:41,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:41,791 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:43:41,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 19:43:41,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:43:41,991 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:41,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:41,993 INFO L85 PathProgramCache]: Analyzing trace with hash 171379611, now seen corresponding path program 1 times [2025-03-03 19:43:41,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:41,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358345013] [2025-03-03 19:43:41,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:41,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:42,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-03 19:43:42,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-03 19:43:42,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:42,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:42,859 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 162 proven. 459 refuted. 0 times theorem prover too weak. 9603 trivial. 0 not checked. [2025-03-03 19:43:42,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:42,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358345013] [2025-03-03 19:43:42,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358345013] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:43:42,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435288317] [2025-03-03 19:43:42,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:42,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:43:42,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:43:42,862 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 19:43:42,863 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 19:43:42,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-03 19:43:43,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-03 19:43:43,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:43,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:43,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 19:43:43,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:43:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 4302 proven. 459 refuted. 0 times theorem prover too weak. 5463 trivial. 0 not checked. [2025-03-03 19:43:45,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:43:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 162 proven. 468 refuted. 0 times theorem prover too weak. 9594 trivial. 0 not checked. [2025-03-03 19:43:46,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435288317] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:43:46,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:43:46,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 13] total 30 [2025-03-03 19:43:46,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086829496] [2025-03-03 19:43:46,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:43:46,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 19:43:46,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:46,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 19:43:46,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2025-03-03 19:43:46,749 INFO L87 Difference]: Start difference. First operand 2869 states and 4576 transitions. Second operand has 30 states, 30 states have (on average 7.9) internal successors, (237), 30 states have internal predecessors, (237), 11 states have call successors, (198), 5 states have call predecessors, (198), 12 states have return successors, (199), 11 states have call predecessors, (199), 11 states have call successors, (199) [2025-03-03 19:43:48,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:48,026 INFO L93 Difference]: Finished difference Result 5771 states and 9096 transitions. [2025-03-03 19:43:48,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 19:43:48,028 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.9) internal successors, (237), 30 states have internal predecessors, (237), 11 states have call successors, (198), 5 states have call predecessors, (198), 12 states have return successors, (199), 11 states have call predecessors, (199), 11 states have call successors, (199) Word has length 459 [2025-03-03 19:43:48,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:48,048 INFO L225 Difference]: With dead ends: 5771 [2025-03-03 19:43:48,048 INFO L226 Difference]: Without dead ends: 3053 [2025-03-03 19:43:48,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 949 GetRequests, 903 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=640, Invalid=1616, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 19:43:48,057 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 1506 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 585 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1506 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 585 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:48,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1506 Valid, 1053 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [585 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 19:43:48,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3053 states. [2025-03-03 19:43:48,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3053 to 2921. [2025-03-03 19:43:48,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2921 states, 2057 states have (on average 1.476421973748177) internal successors, (3037), 2065 states have internal predecessors, (3037), 784 states have call successors, (784), 79 states have call predecessors, (784), 79 states have return successors, (784), 776 states have call predecessors, (784), 784 states have call successors, (784) [2025-03-03 19:43:48,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2921 states to 2921 states and 4605 transitions. [2025-03-03 19:43:48,365 INFO L78 Accepts]: Start accepts. Automaton has 2921 states and 4605 transitions. Word has length 459 [2025-03-03 19:43:48,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:48,366 INFO L471 AbstractCegarLoop]: Abstraction has 2921 states and 4605 transitions. [2025-03-03 19:43:48,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.9) internal successors, (237), 30 states have internal predecessors, (237), 11 states have call successors, (198), 5 states have call predecessors, (198), 12 states have return successors, (199), 11 states have call predecessors, (199), 11 states have call successors, (199) [2025-03-03 19:43:48,366 INFO L276 IsEmpty]: Start isEmpty. Operand 2921 states and 4605 transitions. [2025-03-03 19:43:48,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-03 19:43:48,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:48,369 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:43:48,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 19:43:48,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:43:48,573 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:48,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:48,574 INFO L85 PathProgramCache]: Analyzing trace with hash -69160518, now seen corresponding path program 1 times [2025-03-03 19:43:48,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:48,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947400223] [2025-03-03 19:43:48,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:48,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:48,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-03 19:43:48,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-03 19:43:48,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:48,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:48,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10224 trivial. 0 not checked. [2025-03-03 19:43:48,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:48,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947400223] [2025-03-03 19:43:48,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947400223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:43:48,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:43:48,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:43:48,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679713016] [2025-03-03 19:43:48,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:43:48,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:43:48,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:48,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:43:48,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:43:48,778 INFO L87 Difference]: Start difference. First operand 2921 states and 4605 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-03 19:43:49,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:43:49,129 INFO L93 Difference]: Finished difference Result 5667 states and 8942 transitions. [2025-03-03 19:43:49,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:43:49,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) Word has length 459 [2025-03-03 19:43:49,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:43:49,145 INFO L225 Difference]: With dead ends: 5667 [2025-03-03 19:43:49,145 INFO L226 Difference]: Without dead ends: 2921 [2025-03-03 19:43:49,151 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 19:43:49,152 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 197 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:43:49,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 312 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:43:49,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2025-03-03 19:43:49,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 2921. [2025-03-03 19:43:49,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2921 states, 2057 states have (on average 1.4705882352941178) internal successors, (3025), 2065 states have internal predecessors, (3025), 784 states have call successors, (784), 79 states have call predecessors, (784), 79 states have return successors, (784), 776 states have call predecessors, (784), 784 states have call successors, (784) [2025-03-03 19:43:49,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2921 states to 2921 states and 4593 transitions. [2025-03-03 19:43:49,489 INFO L78 Accepts]: Start accepts. Automaton has 2921 states and 4593 transitions. Word has length 459 [2025-03-03 19:43:49,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:43:49,490 INFO L471 AbstractCegarLoop]: Abstraction has 2921 states and 4593 transitions. [2025-03-03 19:43:49,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 1 states have call successors, (72), 1 states have call predecessors, (72), 1 states have return successors, (72), 1 states have call predecessors, (72), 1 states have call successors, (72) [2025-03-03 19:43:49,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2921 states and 4593 transitions. [2025-03-03 19:43:49,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-03 19:43:49,493 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:43:49,493 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:43:49,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 19:43:49,493 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:43:49,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:43:49,494 INFO L85 PathProgramCache]: Analyzing trace with hash -2058958588, now seen corresponding path program 1 times [2025-03-03 19:43:49,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:43:49,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589347650] [2025-03-03 19:43:49,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:49,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:43:49,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-03 19:43:49,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-03 19:43:49,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:49,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:51,229 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 117 proven. 96 refuted. 0 times theorem prover too weak. 10011 trivial. 0 not checked. [2025-03-03 19:43:51,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:43:51,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589347650] [2025-03-03 19:43:51,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589347650] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:43:51,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696008375] [2025-03-03 19:43:51,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:43:51,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:43:51,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:43:51,233 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 19:43:51,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 19:43:51,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-03 19:43:51,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-03 19:43:51,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:43:51,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:43:51,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 19:43:51,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:43:54,881 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 6282 proven. 249 refuted. 0 times theorem prover too weak. 3693 trivial. 0 not checked. [2025-03-03 19:43:54,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:43:59,705 INFO L134 CoverageAnalysis]: Checked inductivity of 10224 backedges. 372 proven. 258 refuted. 0 times theorem prover too weak. 9594 trivial. 0 not checked. [2025-03-03 19:43:59,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696008375] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:43:59,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:43:59,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 15] total 36 [2025-03-03 19:43:59,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217662881] [2025-03-03 19:43:59,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:43:59,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 19:43:59,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:43:59,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 19:43:59,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1042, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 19:43:59,709 INFO L87 Difference]: Start difference. First operand 2921 states and 4593 transitions. Second operand has 36 states, 36 states have (on average 6.25) internal successors, (225), 35 states have internal predecessors, (225), 10 states have call successors, (142), 4 states have call predecessors, (142), 10 states have return successors, (143), 11 states have call predecessors, (143), 10 states have call successors, (143) [2025-03-03 19:44:07,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 19:44:38,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:44:38,043 INFO L93 Difference]: Finished difference Result 33665 states and 49868 transitions. [2025-03-03 19:44:38,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2025-03-03 19:44:38,044 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 6.25) internal successors, (225), 35 states have internal predecessors, (225), 10 states have call successors, (142), 4 states have call predecessors, (142), 10 states have return successors, (143), 11 states have call predecessors, (143), 10 states have call successors, (143) Word has length 460 [2025-03-03 19:44:38,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:44:38,149 INFO L225 Difference]: With dead ends: 33665 [2025-03-03 19:44:38,149 INFO L226 Difference]: Without dead ends: 31133 [2025-03-03 19:44:38,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1078 GetRequests, 912 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10658 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=6010, Invalid=22046, Unknown=0, NotChecked=0, Total=28056 [2025-03-03 19:44:38,174 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 4626 mSDsluCounter, 3960 mSDsCounter, 0 mSdLazyCounter, 5250 mSolverCounterSat, 3287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4662 SdHoareTripleChecker+Valid, 4486 SdHoareTripleChecker+Invalid, 8537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3287 IncrementalHoareTripleChecker+Valid, 5250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2025-03-03 19:44:38,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4662 Valid, 4486 Invalid, 8537 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3287 Valid, 5250 Invalid, 0 Unknown, 0 Unchecked, 15.8s Time] [2025-03-03 19:44:38,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31133 states. [2025-03-03 19:44:39,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31133 to 6225. [2025-03-03 19:44:39,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6225 states, 4828 states have (on average 1.5186412593206298) internal successors, (7332), 4848 states have internal predecessors, (7332), 1208 states have call successors, (1208), 188 states have call predecessors, (1208), 188 states have return successors, (1208), 1188 states have call predecessors, (1208), 1208 states have call successors, (1208) [2025-03-03 19:44:39,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 9748 transitions. [2025-03-03 19:44:39,705 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 9748 transitions. Word has length 460 [2025-03-03 19:44:39,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:44:39,706 INFO L471 AbstractCegarLoop]: Abstraction has 6225 states and 9748 transitions. [2025-03-03 19:44:39,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 6.25) internal successors, (225), 35 states have internal predecessors, (225), 10 states have call successors, (142), 4 states have call predecessors, (142), 10 states have return successors, (143), 11 states have call predecessors, (143), 10 states have call successors, (143) [2025-03-03 19:44:39,707 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 9748 transitions. [2025-03-03 19:44:39,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-03 19:44:39,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:44:39,710 INFO L218 NwaCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:44:39,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 19:44:39,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 19:44:39,915 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:44:39,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:44:39,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1729192827, now seen corresponding path program 1 times [2025-03-03 19:44:39,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:44:39,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300930569] [2025-03-03 19:44:39,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:44:39,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:44:39,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-03 19:44:39,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-03 19:44:39,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:44:39,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat