./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-82.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-82.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 90db53ce72b1ee9ca381af5f4f7789bdc057550f196d455f7f131773caa16c27 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:51:50,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:51:50,793 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:51:50,797 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:51:50,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:51:50,818 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:51:50,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:51:50,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:51:50,818 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:51:50,820 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:51:50,820 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:51:50,820 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:51:50,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:51:50,821 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:51:50,821 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:51:50,821 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:51:50,821 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:51:50,821 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:51:50,822 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:51:50,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:51:50,822 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:51:50,822 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:51:50,822 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:51:50,822 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:51:50,822 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:51:50,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:51:50,822 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:51:50,822 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:51:50,823 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:51:50,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:51:50,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:51:50,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:51:50,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:51:50,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:51:50,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:51:50,824 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:51:50,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:51:50,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:51:50,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:51:50,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:51:50,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:51:50,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:51:50,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:51:50,824 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 -> 90db53ce72b1ee9ca381af5f4f7789bdc057550f196d455f7f131773caa16c27 [2025-03-03 19:51:51,058 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:51:51,065 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:51:51,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:51:51,069 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:51:51,069 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:51:51,071 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-82.i [2025-03-03 19:51:52,240 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26b4b5778/386fb538ecf04d9d91e13431540f0b84/FLAG41c4da6fe [2025-03-03 19:51:52,526 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:51:52,527 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-82.i [2025-03-03 19:51:52,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26b4b5778/386fb538ecf04d9d91e13431540f0b84/FLAG41c4da6fe [2025-03-03 19:51:52,560 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26b4b5778/386fb538ecf04d9d91e13431540f0b84 [2025-03-03 19:51:52,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:51:52,565 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:51:52,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:51:52,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:51:52,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:51:52,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:51:52" (1/1) ... [2025-03-03 19:51:52,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dcb1481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:52, skipping insertion in model container [2025-03-03 19:51:52,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:51:52" (1/1) ... [2025-03-03 19:51:52,593 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:51:52,685 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-82.i[916,929] [2025-03-03 19:51:52,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:51:52,779 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:51:52,798 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-82.i[916,929] [2025-03-03 19:51:52,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:51:52,900 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:51:52,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:52 WrapperNode [2025-03-03 19:51:52,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:51:52,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:51:52,902 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:51:52,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:51:52,906 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:51:52" (1/1) ... [2025-03-03 19:51:52,924 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:51:52" (1/1) ... [2025-03-03 19:51:52,980 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 573 [2025-03-03 19:51:52,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:51:52,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:51:52,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:51:52,982 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:51:52,988 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:52" (1/1) ... [2025-03-03 19:51:52,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:52" (1/1) ... [2025-03-03 19:51:52,997 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:52" (1/1) ... [2025-03-03 19:51:53,025 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:51:53,029 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:52" (1/1) ... [2025-03-03 19:51:53,029 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:52" (1/1) ... [2025-03-03 19:51:53,041 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:52" (1/1) ... [2025-03-03 19:51:53,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:52" (1/1) ... [2025-03-03 19:51:53,049 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:52" (1/1) ... [2025-03-03 19:51:53,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:52" (1/1) ... [2025-03-03 19:51:53,063 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:51:53,064 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:51:53,064 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:51:53,064 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:51:53,065 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:52" (1/1) ... [2025-03-03 19:51:53,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:51:53,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:51:53,094 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:51:53,101 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:51:53,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:51:53,123 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:51:53,123 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:51:53,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:51:53,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:51:53,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:51:53,228 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:51:53,229 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:51:53,989 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-03 19:51:53,989 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:51:54,019 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:51:54,021 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:51:54,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:51:54 BoogieIcfgContainer [2025-03-03 19:51:54,021 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:51:54,023 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:51:54,024 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:51:54,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:51:54,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:51:52" (1/3) ... [2025-03-03 19:51:54,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14cd4ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:51:54, skipping insertion in model container [2025-03-03 19:51:54,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:51:52" (2/3) ... [2025-03-03 19:51:54,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14cd4ba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:51:54, skipping insertion in model container [2025-03-03 19:51:54,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:51:54" (3/3) ... [2025-03-03 19:51:54,031 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-82.i [2025-03-03 19:51:54,042 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:51:54,045 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-82.i that has 2 procedures, 235 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:51:54,097 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:51:54,107 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;@51140b00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:51:54,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:51:54,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 235 states, 152 states have (on average 1.513157894736842) internal successors, (230), 153 states have internal predecessors, (230), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 19:51:54,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-03-03 19:51:54,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:51:54,137 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:54,137 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:51:54,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:51:54,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1148155562, now seen corresponding path program 1 times [2025-03-03 19:51:54,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:51:54,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126440905] [2025-03-03 19:51:54,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:51:54,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:51:54,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-03 19:51:54,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-03 19:51:54,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:51:54,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:51:54,645 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-03-03 19:51:54,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:51:54,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126440905] [2025-03-03 19:51:54,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126440905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:51:54,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568139115] [2025-03-03 19:51:54,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:51:54,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:51:54,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:51:54,649 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:51:54,652 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:51:54,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-03 19:51:54,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-03 19:51:54,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:51:54,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:51:54,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 1128 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:51:54,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:51:55,008 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-03-03 19:51:55,008 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:51:55,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568139115] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:51:55,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:51:55,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:51:55,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144224664] [2025-03-03 19:51:55,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:51:55,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:51:55,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:51:55,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:51:55,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:51:55,033 INFO L87 Difference]: Start difference. First operand has 235 states, 152 states have (on average 1.513157894736842) internal successors, (230), 153 states have internal predecessors, (230), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) Second operand has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-03 19:51:55,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:51:55,096 INFO L93 Difference]: Finished difference Result 463 states and 853 transitions. [2025-03-03 19:51:55,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:51:55,098 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) Word has length 502 [2025-03-03 19:51:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:51:55,104 INFO L225 Difference]: With dead ends: 463 [2025-03-03 19:51:55,104 INFO L226 Difference]: Without dead ends: 231 [2025-03-03 19:51:55,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 503 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:51:55,115 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:51:55,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 371 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:51:55,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-03 19:51:55,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2025-03-03 19:51:55,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 149 states have (on average 1.4899328859060403) internal successors, (222), 149 states have internal predecessors, (222), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 19:51:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 382 transitions. [2025-03-03 19:51:55,182 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 382 transitions. Word has length 502 [2025-03-03 19:51:55,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:51:55,185 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 382 transitions. [2025-03-03 19:51:55,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-03-03 19:51:55,186 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 382 transitions. [2025-03-03 19:51:55,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2025-03-03 19:51:55,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:51:55,195 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:55,204 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:51:55,396 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:51:55,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:51:55,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:51:55,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1371311108, now seen corresponding path program 1 times [2025-03-03 19:51:55,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:51:55,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718187696] [2025-03-03 19:51:55,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:51:55,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:51:55,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 502 statements into 1 equivalence classes. [2025-03-03 19:51:55,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 502 of 502 statements. [2025-03-03 19:51:55,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:51:55,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:51:55,857 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-03 19:51:55,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:51:55,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718187696] [2025-03-03 19:51:55,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718187696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:51:55,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:51:55,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:51:55,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97353172] [2025-03-03 19:51:55,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:51:55,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:51:55,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:51:55,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:51:55,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:51:55,863 INFO L87 Difference]: Start difference. First operand 231 states and 382 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 19:51:55,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:51:55,985 INFO L93 Difference]: Finished difference Result 594 states and 985 transitions. [2025-03-03 19:51:55,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:51:55,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 502 [2025-03-03 19:51:55,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:51:55,992 INFO L225 Difference]: With dead ends: 594 [2025-03-03 19:51:55,994 INFO L226 Difference]: Without dead ends: 366 [2025-03-03 19:51:55,996 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:51:55,997 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 222 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:51:55,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 706 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:51:56,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-03 19:51:56,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 363. [2025-03-03 19:51:56,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 249 states have (on average 1.5100401606425702) internal successors, (376), 250 states have internal predecessors, (376), 111 states have call successors, (111), 2 states have call predecessors, (111), 2 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2025-03-03 19:51:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 598 transitions. [2025-03-03 19:51:56,061 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 598 transitions. Word has length 502 [2025-03-03 19:51:56,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:51:56,063 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 598 transitions. [2025-03-03 19:51:56,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 19:51:56,064 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 598 transitions. [2025-03-03 19:51:56,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-03-03 19:51:56,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:51:56,072 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:56,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:51:56,072 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:51:56,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:51:56,073 INFO L85 PathProgramCache]: Analyzing trace with hash 887023189, now seen corresponding path program 1 times [2025-03-03 19:51:56,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:51:56,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655785897] [2025-03-03 19:51:56,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:51:56,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:51:56,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-03-03 19:51:56,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-03-03 19:51:56,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:51:56,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:51:57,067 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-03 19:51:57,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:51:57,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655785897] [2025-03-03 19:51:57,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655785897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:51:57,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:51:57,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:51:57,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495960315] [2025-03-03 19:51:57,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:51:57,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:51:57,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:51:57,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:51:57,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:51:57,072 INFO L87 Difference]: Start difference. First operand 363 states and 598 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 19:51:57,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:51:57,342 INFO L93 Difference]: Finished difference Result 981 states and 1618 transitions. [2025-03-03 19:51:57,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:51:57,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 503 [2025-03-03 19:51:57,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:51:57,350 INFO L225 Difference]: With dead ends: 981 [2025-03-03 19:51:57,350 INFO L226 Difference]: Without dead ends: 621 [2025-03-03 19:51:57,353 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:51:57,354 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 209 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:51:57,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 989 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:51:57,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2025-03-03 19:51:57,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 611. [2025-03-03 19:51:57,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 437 states have (on average 1.528604118993135) internal successors, (668), 440 states have internal predecessors, (668), 169 states have call successors, (169), 4 states have call predecessors, (169), 4 states have return successors, (169), 166 states have call predecessors, (169), 169 states have call successors, (169) [2025-03-03 19:51:57,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1006 transitions. [2025-03-03 19:51:57,409 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 1006 transitions. Word has length 503 [2025-03-03 19:51:57,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:51:57,410 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 1006 transitions. [2025-03-03 19:51:57,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 19:51:57,414 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1006 transitions. [2025-03-03 19:51:57,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-03-03 19:51:57,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:51:57,422 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:57,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:51:57,422 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:51:57,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:51:57,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1020411692, now seen corresponding path program 1 times [2025-03-03 19:51:57,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:51:57,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917459104] [2025-03-03 19:51:57,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:51:57,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:51:57,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-03-03 19:51:57,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-03-03 19:51:57,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:51:57,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:51:59,173 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-03 19:51:59,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:51:59,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917459104] [2025-03-03 19:51:59,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917459104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:51:59,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:51:59,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 19:51:59,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83230739] [2025-03-03 19:51:59,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:51:59,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:51:59,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:51:59,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:51:59,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:51:59,175 INFO L87 Difference]: Start difference. First operand 611 states and 1006 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 19:52:00,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:00,431 INFO L93 Difference]: Finished difference Result 1531 states and 2500 transitions. [2025-03-03 19:52:00,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 19:52:00,432 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 504 [2025-03-03 19:52:00,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:00,439 INFO L225 Difference]: With dead ends: 1531 [2025-03-03 19:52:00,439 INFO L226 Difference]: Without dead ends: 923 [2025-03-03 19:52:00,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:52:00,444 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 995 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:00,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 1910 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 19:52:00,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2025-03-03 19:52:00,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 635. [2025-03-03 19:52:00,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 461 states have (on average 1.5336225596529285) internal successors, (707), 464 states have internal predecessors, (707), 169 states have call successors, (169), 4 states have call predecessors, (169), 4 states have return successors, (169), 166 states have call predecessors, (169), 169 states have call successors, (169) [2025-03-03 19:52:00,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1045 transitions. [2025-03-03 19:52:00,524 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1045 transitions. Word has length 504 [2025-03-03 19:52:00,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:00,525 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 1045 transitions. [2025-03-03 19:52:00,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 19:52:00,525 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1045 transitions. [2025-03-03 19:52:00,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-03-03 19:52:00,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:00,534 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:00,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:52:00,534 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:00,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:00,535 INFO L85 PathProgramCache]: Analyzing trace with hash -2029791123, now seen corresponding path program 1 times [2025-03-03 19:52:00,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:00,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387007585] [2025-03-03 19:52:00,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:00,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:00,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-03-03 19:52:00,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-03-03 19:52:00,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:00,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 177 proven. 60 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-03-03 19:52:01,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:01,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387007585] [2025-03-03 19:52:01,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387007585] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:52:01,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304503598] [2025-03-03 19:52:01,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:01,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:52:01,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:52:01,126 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:52:01,128 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:52:01,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 504 statements into 1 equivalence classes. [2025-03-03 19:52:01,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 504 of 504 statements. [2025-03-03 19:52:01,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:01,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:01,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 19:52:01,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:52:01,493 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 849 proven. 6 refuted. 0 times theorem prover too weak. 11785 trivial. 0 not checked. [2025-03-03 19:52:01,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:52:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 231 proven. 6 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-03-03 19:52:01,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304503598] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:52:01,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:52:01,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-03 19:52:01,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553377256] [2025-03-03 19:52:01,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:52:01,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 19:52:01,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:01,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 19:52:01,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:52:01,838 INFO L87 Difference]: Start difference. First operand 635 states and 1045 transitions. Second operand has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 3 states have call successors, (102), 2 states have call predecessors, (102), 4 states have return successors, (104), 3 states have call predecessors, (104), 3 states have call successors, (104) [2025-03-03 19:52:02,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:02,491 INFO L93 Difference]: Finished difference Result 1282 states and 2100 transitions. [2025-03-03 19:52:02,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 19:52:02,492 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 3 states have call successors, (102), 2 states have call predecessors, (102), 4 states have return successors, (104), 3 states have call predecessors, (104), 3 states have call successors, (104) Word has length 504 [2025-03-03 19:52:02,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:02,496 INFO L225 Difference]: With dead ends: 1282 [2025-03-03 19:52:02,496 INFO L226 Difference]: Without dead ends: 650 [2025-03-03 19:52:02,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1021 GetRequests, 1005 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-03-03 19:52:02,500 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 723 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 608 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 608 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:02,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 679 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [608 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 19:52:02,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-03-03 19:52:02,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 640. [2025-03-03 19:52:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 464 states have (on average 1.5107758620689655) internal successors, (701), 467 states have internal predecessors, (701), 169 states have call successors, (169), 6 states have call predecessors, (169), 6 states have return successors, (169), 166 states have call predecessors, (169), 169 states have call successors, (169) [2025-03-03 19:52:02,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1039 transitions. [2025-03-03 19:52:02,550 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1039 transitions. Word has length 504 [2025-03-03 19:52:02,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:02,551 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 1039 transitions. [2025-03-03 19:52:02,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.875) internal successors, (167), 8 states have internal predecessors, (167), 3 states have call successors, (102), 2 states have call predecessors, (102), 4 states have return successors, (104), 3 states have call predecessors, (104), 3 states have call successors, (104) [2025-03-03 19:52:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1039 transitions. [2025-03-03 19:52:02,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-03-03 19:52:02,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:02,557 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:02,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 19:52:02,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:52:02,758 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:02,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:02,759 INFO L85 PathProgramCache]: Analyzing trace with hash 759588658, now seen corresponding path program 1 times [2025-03-03 19:52:02,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:02,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049142392] [2025-03-03 19:52:02,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:02,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:02,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-03-03 19:52:02,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-03-03 19:52:02,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:02,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:03,114 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-03-03 19:52:03,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:03,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049142392] [2025-03-03 19:52:03,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049142392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:52:03,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:52:03,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:52:03,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634690749] [2025-03-03 19:52:03,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:52:03,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:52:03,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:03,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:52:03,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:52:03,116 INFO L87 Difference]: Start difference. First operand 640 states and 1039 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 19:52:03,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:03,370 INFO L93 Difference]: Finished difference Result 1281 states and 2079 transitions. [2025-03-03 19:52:03,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:52:03,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 505 [2025-03-03 19:52:03,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:03,377 INFO L225 Difference]: With dead ends: 1281 [2025-03-03 19:52:03,377 INFO L226 Difference]: Without dead ends: 644 [2025-03-03 19:52:03,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:52:03,380 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 592 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:03,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 367 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:52:03,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-03-03 19:52:03,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 640. [2025-03-03 19:52:03,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 464 states have (on average 1.5021551724137931) internal successors, (697), 467 states have internal predecessors, (697), 169 states have call successors, (169), 6 states have call predecessors, (169), 6 states have return successors, (169), 166 states have call predecessors, (169), 169 states have call successors, (169) [2025-03-03 19:52:03,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1035 transitions. [2025-03-03 19:52:03,422 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1035 transitions. Word has length 505 [2025-03-03 19:52:03,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:03,423 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 1035 transitions. [2025-03-03 19:52:03,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-03-03 19:52:03,423 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1035 transitions. [2025-03-03 19:52:03,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-03-03 19:52:03,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:03,427 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:03,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:52:03,427 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:03,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:03,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2027826829, now seen corresponding path program 1 times [2025-03-03 19:52:03,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:03,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109362366] [2025-03-03 19:52:03,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:03,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:03,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-03-03 19:52:03,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-03-03 19:52:03,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:03,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:03,870 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 87 proven. 150 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-03-03 19:52:03,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:03,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109362366] [2025-03-03 19:52:03,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109362366] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:52:03,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842948300] [2025-03-03 19:52:03,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:03,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:52:03,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:52:03,873 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:52:03,874 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:52:03,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-03-03 19:52:04,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-03-03 19:52:04,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:04,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:04,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 1128 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 19:52:04,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:52:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 5937 proven. 150 refuted. 0 times theorem prover too weak. 6553 trivial. 0 not checked. [2025-03-03 19:52:04,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:52:04,995 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 87 proven. 150 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-03-03 19:52:04,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842948300] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:52:04,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:52:04,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2025-03-03 19:52:04,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098859071] [2025-03-03 19:52:04,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:52:04,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:52:04,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:04,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:52:04,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:52:04,998 INFO L87 Difference]: Start difference. First operand 640 states and 1035 transitions. Second operand has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 4 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 4 states have call predecessors, (181), 4 states have call successors, (181) [2025-03-03 19:52:05,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:52:05,377 INFO L93 Difference]: Finished difference Result 1041 states and 1661 transitions. [2025-03-03 19:52:05,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 19:52:05,378 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 4 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 4 states have call predecessors, (181), 4 states have call successors, (181) Word has length 505 [2025-03-03 19:52:05,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:52:05,381 INFO L225 Difference]: With dead ends: 1041 [2025-03-03 19:52:05,381 INFO L226 Difference]: Without dead ends: 404 [2025-03-03 19:52:05,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1017 GetRequests, 1007 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2025-03-03 19:52:05,383 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 174 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 19:52:05,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 626 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 19:52:05,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-03-03 19:52:05,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 396. [2025-03-03 19:52:05,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 276 states have (on average 1.4202898550724639) internal successors, (392), 277 states have internal predecessors, (392), 111 states have call successors, (111), 8 states have call predecessors, (111), 8 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2025-03-03 19:52:05,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 614 transitions. [2025-03-03 19:52:05,408 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 614 transitions. Word has length 505 [2025-03-03 19:52:05,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:52:05,409 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 614 transitions. [2025-03-03 19:52:05,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.666666666666668) internal successors, (213), 9 states have internal predecessors, (213), 4 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 4 states have call predecessors, (181), 4 states have call successors, (181) [2025-03-03 19:52:05,410 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 614 transitions. [2025-03-03 19:52:05,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2025-03-03 19:52:05,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:52:05,412 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:05,420 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:52:05,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:52:05,613 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:52:05,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:52:05,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1723994970, now seen corresponding path program 1 times [2025-03-03 19:52:05,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:52:05,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306073367] [2025-03-03 19:52:05,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:05,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:52:05,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-03 19:52:05,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-03 19:52:05,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:05,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:08,668 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 153 proven. 84 refuted. 0 times theorem prover too weak. 12403 trivial. 0 not checked. [2025-03-03 19:52:08,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:52:08,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306073367] [2025-03-03 19:52:08,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306073367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:52:08,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579644961] [2025-03-03 19:52:08,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:52:08,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:52:08,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:52:08,671 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:52:08,672 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:52:08,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 506 statements into 1 equivalence classes. [2025-03-03 19:52:08,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 506 of 506 statements. [2025-03-03 19:52:08,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:52:08,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:52:08,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 1126 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-03 19:52:08,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:52:15,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 9077 proven. 873 refuted. 0 times theorem prover too weak. 2690 trivial. 0 not checked. [2025-03-03 19:52:15,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:52:18,009 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 651 proven. 504 refuted. 0 times theorem prover too weak. 11485 trivial. 0 not checked. [2025-03-03 19:52:18,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579644961] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:52:18,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:52:18,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 28, 23] total 59 [2025-03-03 19:52:18,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450529695] [2025-03-03 19:52:18,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:52:18,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-03-03 19:52:18,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:52:18,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-03-03 19:52:18,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=2823, Unknown=0, NotChecked=0, Total=3422 [2025-03-03 19:52:18,037 INFO L87 Difference]: Start difference. First operand 396 states and 614 transitions. Second operand has 59 states, 56 states have (on average 5.089285714285714) internal successors, (285), 54 states have internal predecessors, (285), 18 states have call successors, (180), 8 states have call predecessors, (180), 17 states have return successors, (183), 18 states have call predecessors, (183), 18 states have call successors, (183)