./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-7.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-500_file-7.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 bce3f4946b012785e1af0be5b8b016db5fe69db64eb839688905085209631246 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:10:28,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:10:28,103 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:10:28,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:10:28,111 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:10:28,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:10:28,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:10:28,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:10:28,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:10:28,137 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:10:28,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:10:28,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:10:28,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:10:28,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:10:28,138 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:10:28,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:10:28,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:10:28,138 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:10:28,139 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:10:28,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:10:28,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:10:28,139 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:10:28,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:10:28,139 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:10:28,139 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:10:28,139 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:10:28,139 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:10:28,139 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:10:28,139 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:10:28,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:10:28,140 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:10:28,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:10:28,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:10:28,140 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:10:28,140 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:10:28,140 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:10:28,140 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:10:28,141 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:10:28,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:10:28,141 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:10:28,141 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:10:28,141 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:10:28,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:10:28,141 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 -> bce3f4946b012785e1af0be5b8b016db5fe69db64eb839688905085209631246 [2025-03-03 20:10:28,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:10:28,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:10:28,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:10:28,376 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:10:28,377 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:10:28,377 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-500_file-7.i [2025-03-03 20:10:29,526 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4b722d07/4d317d7c816d4124b462624996ca25d2/FLAG5f6da66c0 [2025-03-03 20:10:29,842 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:10:29,842 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-7.i [2025-03-03 20:10:29,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4b722d07/4d317d7c816d4124b462624996ca25d2/FLAG5f6da66c0 [2025-03-03 20:10:30,089 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4b722d07/4d317d7c816d4124b462624996ca25d2 [2025-03-03 20:10:30,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:10:30,093 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:10:30,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:10:30,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:10:30,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:10:30,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:10:30" (1/1) ... [2025-03-03 20:10:30,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655b42f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:30, skipping insertion in model container [2025-03-03 20:10:30,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:10:30" (1/1) ... [2025-03-03 20:10:30,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:10:30,240 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-500_file-7.i[915,928] [2025-03-03 20:10:30,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:10:30,401 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:10:30,411 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-500_file-7.i[915,928] [2025-03-03 20:10:30,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:10:30,485 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:10:30,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:30 WrapperNode [2025-03-03 20:10:30,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:10:30,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:10:30,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:10:30,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:10:30,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:30" (1/1) ... [2025-03-03 20:10:30,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:30" (1/1) ... [2025-03-03 20:10:30,564 INFO L138 Inliner]: procedures = 26, calls = 114, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 901 [2025-03-03 20:10:30,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:10:30,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:10:30,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:10:30,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:10:30,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:30" (1/1) ... [2025-03-03 20:10:30,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:30" (1/1) ... [2025-03-03 20:10:30,585 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:30" (1/1) ... [2025-03-03 20:10:30,615 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:10:30,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:30" (1/1) ... [2025-03-03 20:10:30,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:30" (1/1) ... [2025-03-03 20:10:30,638 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:30" (1/1) ... [2025-03-03 20:10:30,641 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:30" (1/1) ... [2025-03-03 20:10:30,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:30" (1/1) ... [2025-03-03 20:10:30,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:30" (1/1) ... [2025-03-03 20:10:30,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:10:30,664 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:10:30,664 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:10:30,664 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:10:30,665 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:30" (1/1) ... [2025-03-03 20:10:30,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:10:30,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:10:30,692 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:10:30,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:10:30,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:10:30,711 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:10:30,711 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:10:30,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:10:30,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:10:30,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:10:30,832 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:10:30,834 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:10:31,810 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-03 20:10:31,810 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:10:31,853 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:10:31,853 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-03 20:10:31,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:10:31 BoogieIcfgContainer [2025-03-03 20:10:31,854 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:10:31,856 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:10:31,856 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:10:31,860 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:10:31,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:10:30" (1/3) ... [2025-03-03 20:10:31,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@444a6eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:10:31, skipping insertion in model container [2025-03-03 20:10:31,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:30" (2/3) ... [2025-03-03 20:10:31,862 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@444a6eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:10:31, skipping insertion in model container [2025-03-03 20:10:31,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:10:31" (3/3) ... [2025-03-03 20:10:31,863 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-7.i [2025-03-03 20:10:31,874 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:10:31,877 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-7.i that has 2 procedures, 361 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:10:31,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:10:31,950 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;@734a4d75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:10:31,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:10:31,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 361 states, 257 states have (on average 1.583657587548638) internal successors, (407), 258 states have internal predecessors, (407), 101 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 101 states have call predecessors, (101), 101 states have call successors, (101) [2025-03-03 20:10:31,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2025-03-03 20:10:31,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:31,984 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:31,985 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:31,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:31,990 INFO L85 PathProgramCache]: Analyzing trace with hash -613279709, now seen corresponding path program 1 times [2025-03-03 20:10:31,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:31,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770216688] [2025-03-03 20:10:31,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:31,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:32,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 656 statements into 1 equivalence classes. [2025-03-03 20:10:32,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 656 of 656 statements. [2025-03-03 20:10:32,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:32,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 20000 trivial. 0 not checked. [2025-03-03 20:10:32,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:32,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770216688] [2025-03-03 20:10:32,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770216688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:10:32,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749869224] [2025-03-03 20:10:32,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:32,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:10:32,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:10:32,591 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:10:32,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:10:32,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 656 statements into 1 equivalence classes. [2025-03-03 20:10:32,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 656 of 656 statements. [2025-03-03 20:10:32,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:32,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:32,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 1505 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:10:32,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:10:33,064 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 20000 trivial. 0 not checked. [2025-03-03 20:10:33,064 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:10:33,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749869224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:33,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:10:33,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:10:33,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915763380] [2025-03-03 20:10:33,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:33,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:10:33,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:33,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:10:33,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:10:33,086 INFO L87 Difference]: Start difference. First operand has 361 states, 257 states have (on average 1.583657587548638) internal successors, (407), 258 states have internal predecessors, (407), 101 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 101 states have call predecessors, (101), 101 states have call successors, (101) Second operand has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 2 states have call successors, (101), 2 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 2 states have call successors, (101) [2025-03-03 20:10:33,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:33,165 INFO L93 Difference]: Finished difference Result 716 states and 1314 transitions. [2025-03-03 20:10:33,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:10:33,167 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 2 states have call successors, (101), 2 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 2 states have call successors, (101) Word has length 656 [2025-03-03 20:10:33,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:33,174 INFO L225 Difference]: With dead ends: 716 [2025-03-03 20:10:33,174 INFO L226 Difference]: Without dead ends: 358 [2025-03-03 20:10:33,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 657 GetRequests, 657 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:10:33,181 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:33,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:10:33,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-03-03 20:10:33,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2025-03-03 20:10:33,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 255 states have (on average 1.5686274509803921) internal successors, (400), 255 states have internal predecessors, (400), 101 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 101 states have call predecessors, (101), 101 states have call successors, (101) [2025-03-03 20:10:33,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 602 transitions. [2025-03-03 20:10:33,264 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 602 transitions. Word has length 656 [2025-03-03 20:10:33,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:33,266 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 602 transitions. [2025-03-03 20:10:33,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.0) internal successors, (156), 2 states have internal predecessors, (156), 2 states have call successors, (101), 2 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 2 states have call successors, (101) [2025-03-03 20:10:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 602 transitions. [2025-03-03 20:10:33,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2025-03-03 20:10:33,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:33,283 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:33,292 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 20:10:33,489 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 20:10:33,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:33,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:33,492 INFO L85 PathProgramCache]: Analyzing trace with hash 708260787, now seen corresponding path program 1 times [2025-03-03 20:10:33,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:33,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153524030] [2025-03-03 20:10:33,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:33,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:33,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 657 statements into 1 equivalence classes. [2025-03-03 20:10:33,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 657 of 657 statements. [2025-03-03 20:10:33,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:33,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:34,216 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-03-03 20:10:34,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:34,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153524030] [2025-03-03 20:10:34,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153524030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:34,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:34,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:34,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424129927] [2025-03-03 20:10:34,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:34,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:34,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:34,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:34,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:34,221 INFO L87 Difference]: Start difference. First operand 358 states and 602 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-03 20:10:34,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:34,339 INFO L93 Difference]: Finished difference Result 957 states and 1616 transitions. [2025-03-03 20:10:34,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:34,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 657 [2025-03-03 20:10:34,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:34,345 INFO L225 Difference]: With dead ends: 957 [2025-03-03 20:10:34,345 INFO L226 Difference]: Without dead ends: 602 [2025-03-03 20:10:34,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:34,347 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 382 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:34,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1130 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:34,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-03-03 20:10:34,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 599. [2025-03-03 20:10:34,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 456 states have (on average 1.605263157894737) internal successors, (732), 457 states have internal predecessors, (732), 140 states have call successors, (140), 2 states have call predecessors, (140), 2 states have return successors, (140), 139 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-03 20:10:34,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1012 transitions. [2025-03-03 20:10:34,410 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1012 transitions. Word has length 657 [2025-03-03 20:10:34,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:34,413 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 1012 transitions. [2025-03-03 20:10:34,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-03 20:10:34,413 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1012 transitions. [2025-03-03 20:10:34,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2025-03-03 20:10:34,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:34,424 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:34,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:10:34,424 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:34,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:34,426 INFO L85 PathProgramCache]: Analyzing trace with hash -201700045, now seen corresponding path program 1 times [2025-03-03 20:10:34,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:34,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509514975] [2025-03-03 20:10:34,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:34,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:34,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-03-03 20:10:34,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-03-03 20:10:34,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:34,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:34,837 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-03-03 20:10:34,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:34,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509514975] [2025-03-03 20:10:34,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509514975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:34,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:34,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:34,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136269901] [2025-03-03 20:10:34,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:34,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:34,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:34,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:34,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:34,843 INFO L87 Difference]: Start difference. First operand 599 states and 1012 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-03 20:10:34,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:34,976 INFO L93 Difference]: Finished difference Result 1645 states and 2778 transitions. [2025-03-03 20:10:34,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:34,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 658 [2025-03-03 20:10:34,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:34,987 INFO L225 Difference]: With dead ends: 1645 [2025-03-03 20:10:34,987 INFO L226 Difference]: Without dead ends: 1049 [2025-03-03 20:10:34,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:34,991 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 386 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:34,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1259 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:34,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2025-03-03 20:10:35,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1046. [2025-03-03 20:10:35,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 801 states have (on average 1.6029962546816479) internal successors, (1284), 804 states have internal predecessors, (1284), 240 states have call successors, (240), 4 states have call predecessors, (240), 4 states have return successors, (240), 237 states have call predecessors, (240), 240 states have call successors, (240) [2025-03-03 20:10:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1764 transitions. [2025-03-03 20:10:35,058 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1764 transitions. Word has length 658 [2025-03-03 20:10:35,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:35,059 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1764 transitions. [2025-03-03 20:10:35,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-03 20:10:35,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1764 transitions. [2025-03-03 20:10:35,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2025-03-03 20:10:35,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:35,067 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:35,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:10:35,068 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:35,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:35,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1056089995, now seen corresponding path program 1 times [2025-03-03 20:10:35,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:35,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273589740] [2025-03-03 20:10:35,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:35,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:35,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-03-03 20:10:35,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-03-03 20:10:35,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:35,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:35,338 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-03-03 20:10:35,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:35,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273589740] [2025-03-03 20:10:35,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273589740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:35,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:35,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:35,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565998645] [2025-03-03 20:10:35,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:35,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:35,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:35,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:35,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:35,341 INFO L87 Difference]: Start difference. First operand 1046 states and 1764 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-03 20:10:35,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:35,496 INFO L93 Difference]: Finished difference Result 2996 states and 5030 transitions. [2025-03-03 20:10:35,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:35,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 658 [2025-03-03 20:10:35,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:35,508 INFO L225 Difference]: With dead ends: 2996 [2025-03-03 20:10:35,508 INFO L226 Difference]: Without dead ends: 1953 [2025-03-03 20:10:35,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:35,513 INFO L435 NwaCegarLoop]: 1044 mSDtfsCounter, 521 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:35,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1614 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:35,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2025-03-03 20:10:35,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1094. [2025-03-03 20:10:35,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 849 states have (on average 1.5948174322732627) internal successors, (1354), 852 states have internal predecessors, (1354), 240 states have call successors, (240), 4 states have call predecessors, (240), 4 states have return successors, (240), 237 states have call predecessors, (240), 240 states have call successors, (240) [2025-03-03 20:10:35,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1834 transitions. [2025-03-03 20:10:35,610 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1834 transitions. Word has length 658 [2025-03-03 20:10:35,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:35,611 INFO L471 AbstractCegarLoop]: Abstraction has 1094 states and 1834 transitions. [2025-03-03 20:10:35,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-03 20:10:35,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1834 transitions. [2025-03-03 20:10:35,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2025-03-03 20:10:35,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:35,617 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:35,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:10:35,618 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:35,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:35,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1349493002, now seen corresponding path program 1 times [2025-03-03 20:10:35,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:35,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446815335] [2025-03-03 20:10:35,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:35,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:35,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-03-03 20:10:35,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-03-03 20:10:35,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:35,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:36,078 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-03-03 20:10:36,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:36,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446815335] [2025-03-03 20:10:36,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446815335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:36,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:36,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:36,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568472004] [2025-03-03 20:10:36,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:36,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:36,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:36,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:36,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:36,080 INFO L87 Difference]: Start difference. First operand 1094 states and 1834 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-03 20:10:36,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:36,227 INFO L93 Difference]: Finished difference Result 3101 states and 5184 transitions. [2025-03-03 20:10:36,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:36,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 658 [2025-03-03 20:10:36,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:36,238 INFO L225 Difference]: With dead ends: 3101 [2025-03-03 20:10:36,238 INFO L226 Difference]: Without dead ends: 2010 [2025-03-03 20:10:36,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:36,242 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 403 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:36,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1314 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:36,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2010 states. [2025-03-03 20:10:36,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2010 to 2007. [2025-03-03 20:10:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2007 states, 1552 states have (on average 1.5818298969072164) internal successors, (2455), 1559 states have internal predecessors, (2455), 446 states have call successors, (446), 8 states have call predecessors, (446), 8 states have return successors, (446), 439 states have call predecessors, (446), 446 states have call successors, (446) [2025-03-03 20:10:36,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 3347 transitions. [2025-03-03 20:10:36,368 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 3347 transitions. Word has length 658 [2025-03-03 20:10:36,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:36,371 INFO L471 AbstractCegarLoop]: Abstraction has 2007 states and 3347 transitions. [2025-03-03 20:10:36,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-03 20:10:36,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 3347 transitions. [2025-03-03 20:10:36,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2025-03-03 20:10:36,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:36,382 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:36,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:10:36,383 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:36,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:36,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1014855189, now seen corresponding path program 1 times [2025-03-03 20:10:36,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:36,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805129186] [2025-03-03 20:10:36,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:36,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:36,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-03-03 20:10:36,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-03-03 20:10:36,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:36,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:37,111 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-03-03 20:10:37,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:37,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805129186] [2025-03-03 20:10:37,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805129186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:37,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:37,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:37,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655690138] [2025-03-03 20:10:37,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:37,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:37,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:37,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:37,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:37,117 INFO L87 Difference]: Start difference. First operand 2007 states and 3347 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-03 20:10:37,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:37,272 INFO L93 Difference]: Finished difference Result 4011 states and 6691 transitions. [2025-03-03 20:10:37,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:37,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 658 [2025-03-03 20:10:37,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:37,290 INFO L225 Difference]: With dead ends: 4011 [2025-03-03 20:10:37,290 INFO L226 Difference]: Without dead ends: 2007 [2025-03-03 20:10:37,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:37,297 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 408 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:37,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 569 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:10:37,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2025-03-03 20:10:37,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 2007. [2025-03-03 20:10:37,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2007 states, 1552 states have (on average 1.553479381443299) internal successors, (2411), 1559 states have internal predecessors, (2411), 446 states have call successors, (446), 8 states have call predecessors, (446), 8 states have return successors, (446), 439 states have call predecessors, (446), 446 states have call successors, (446) [2025-03-03 20:10:37,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 3303 transitions. [2025-03-03 20:10:37,434 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 3303 transitions. Word has length 658 [2025-03-03 20:10:37,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:37,436 INFO L471 AbstractCegarLoop]: Abstraction has 2007 states and 3303 transitions. [2025-03-03 20:10:37,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-03 20:10:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 3303 transitions. [2025-03-03 20:10:37,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2025-03-03 20:10:37,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:37,442 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:37,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:10:37,442 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:37,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:37,443 INFO L85 PathProgramCache]: Analyzing trace with hash 745700275, now seen corresponding path program 1 times [2025-03-03 20:10:37,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:37,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874241685] [2025-03-03 20:10:37,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:37,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:37,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-03-03 20:10:37,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-03-03 20:10:37,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:37,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:37,952 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-03-03 20:10:37,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:37,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874241685] [2025-03-03 20:10:37,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874241685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:37,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:37,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:37,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102541701] [2025-03-03 20:10:37,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:37,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:37,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:37,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:37,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:37,956 INFO L87 Difference]: Start difference. First operand 2007 states and 3303 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-03 20:10:38,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:38,289 INFO L93 Difference]: Finished difference Result 6015 states and 9903 transitions. [2025-03-03 20:10:38,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:38,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 658 [2025-03-03 20:10:38,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:38,315 INFO L225 Difference]: With dead ends: 6015 [2025-03-03 20:10:38,315 INFO L226 Difference]: Without dead ends: 4011 [2025-03-03 20:10:38,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:38,323 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 396 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:38,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1322 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:38,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4011 states. [2025-03-03 20:10:38,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4011 to 4009. [2025-03-03 20:10:38,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4009 states, 3100 states have (on average 1.5490322580645162) internal successors, (4802), 3114 states have internal predecessors, (4802), 892 states have call successors, (892), 16 states have call predecessors, (892), 16 states have return successors, (892), 878 states have call predecessors, (892), 892 states have call successors, (892) [2025-03-03 20:10:38,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4009 states to 4009 states and 6586 transitions. [2025-03-03 20:10:38,654 INFO L78 Accepts]: Start accepts. Automaton has 4009 states and 6586 transitions. Word has length 658 [2025-03-03 20:10:38,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:38,655 INFO L471 AbstractCegarLoop]: Abstraction has 4009 states and 6586 transitions. [2025-03-03 20:10:38,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-03 20:10:38,655 INFO L276 IsEmpty]: Start isEmpty. Operand 4009 states and 6586 transitions. [2025-03-03 20:10:38,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2025-03-03 20:10:38,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:38,662 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:38,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:10:38,662 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:38,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:38,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1517735949, now seen corresponding path program 1 times [2025-03-03 20:10:38,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:38,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534151742] [2025-03-03 20:10:38,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:38,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:38,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-03-03 20:10:38,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-03-03 20:10:38,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:38,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:39,108 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-03-03 20:10:39,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:39,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534151742] [2025-03-03 20:10:39,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534151742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:39,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:39,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:10:39,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181260070] [2025-03-03 20:10:39,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:39,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:10:39,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:39,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:10:39,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:10:39,110 INFO L87 Difference]: Start difference. First operand 4009 states and 6586 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-03 20:10:39,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:39,762 INFO L93 Difference]: Finished difference Result 14493 states and 23843 transitions. [2025-03-03 20:10:39,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:10:39,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) Word has length 658 [2025-03-03 20:10:39,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:39,820 INFO L225 Difference]: With dead ends: 14493 [2025-03-03 20:10:39,820 INFO L226 Difference]: Without dead ends: 10487 [2025-03-03 20:10:39,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:10:39,834 INFO L435 NwaCegarLoop]: 844 mSDtfsCounter, 843 mSDsluCounter, 1963 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 2807 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:39,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 2807 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:10:39,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10487 states. [2025-03-03 20:10:40,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10487 to 10451. [2025-03-03 20:10:40,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10451 states, 8678 states have (on average 1.5840055312283936) internal successors, (13746), 8724 states have internal predecessors, (13746), 1724 states have call successors, (1724), 48 states have call predecessors, (1724), 48 states have return successors, (1724), 1678 states have call predecessors, (1724), 1724 states have call successors, (1724) [2025-03-03 20:10:40,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10451 states to 10451 states and 17194 transitions. [2025-03-03 20:10:40,375 INFO L78 Accepts]: Start accepts. Automaton has 10451 states and 17194 transitions. Word has length 658 [2025-03-03 20:10:40,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:40,376 INFO L471 AbstractCegarLoop]: Abstraction has 10451 states and 17194 transitions. [2025-03-03 20:10:40,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 1 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 1 states have call predecessors, (101), 1 states have call successors, (101) [2025-03-03 20:10:40,376 INFO L276 IsEmpty]: Start isEmpty. Operand 10451 states and 17194 transitions. [2025-03-03 20:10:40,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2025-03-03 20:10:40,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:40,392 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:40,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:10:40,392 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:40,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:40,392 INFO L85 PathProgramCache]: Analyzing trace with hash -309817774, now seen corresponding path program 1 times [2025-03-03 20:10:40,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:40,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898501113] [2025-03-03 20:10:40,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:40,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:40,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-03-03 20:10:40,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-03-03 20:10:40,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:40,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:45,148 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-03-03 20:10:45,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:45,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898501113] [2025-03-03 20:10:45,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898501113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:45,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:45,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 20:10:45,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275863653] [2025-03-03 20:10:45,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:45,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 20:10:45,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:45,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 20:10:45,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:10:45,151 INFO L87 Difference]: Start difference. First operand 10451 states and 17194 transitions. Second operand has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 2 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 2 states have call predecessors, (101), 2 states have call successors, (101) [2025-03-03 20:10:53,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:53,790 INFO L93 Difference]: Finished difference Result 59475 states and 95913 transitions. [2025-03-03 20:10:53,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 20:10:53,791 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 2 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 2 states have call predecessors, (101), 2 states have call successors, (101) Word has length 658 [2025-03-03 20:10:53,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:53,973 INFO L225 Difference]: With dead ends: 59475 [2025-03-03 20:10:53,973 INFO L226 Difference]: Without dead ends: 49027 [2025-03-03 20:10:54,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:10:54,023 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 4025 mSDsluCounter, 2312 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 816 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4025 SdHoareTripleChecker+Valid, 2946 SdHoareTripleChecker+Invalid, 3307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 816 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:54,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4025 Valid, 2946 Invalid, 3307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [816 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-03-03 20:10:54,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49027 states. [2025-03-03 20:10:55,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49027 to 29759. [2025-03-03 20:10:55,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29759 states, 24386 states have (on average 1.5471171983925203) internal successors, (37728), 24560 states have internal predecessors, (37728), 5196 states have call successors, (5196), 176 states have call predecessors, (5196), 176 states have return successors, (5196), 5022 states have call predecessors, (5196), 5196 states have call successors, (5196) [2025-03-03 20:10:55,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29759 states to 29759 states and 48120 transitions. [2025-03-03 20:10:55,983 INFO L78 Accepts]: Start accepts. Automaton has 29759 states and 48120 transitions. Word has length 658 [2025-03-03 20:10:55,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:55,984 INFO L471 AbstractCegarLoop]: Abstraction has 29759 states and 48120 transitions. [2025-03-03 20:10:55,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 2 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 2 states have call predecessors, (101), 2 states have call successors, (101) [2025-03-03 20:10:55,985 INFO L276 IsEmpty]: Start isEmpty. Operand 29759 states and 48120 transitions. [2025-03-03 20:10:56,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2025-03-03 20:10:56,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:56,017 INFO L218 NwaCegarLoop]: trace histogram [101, 101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:10:56,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:10:56,017 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:56,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:56,018 INFO L85 PathProgramCache]: Analyzing trace with hash 651796243, now seen corresponding path program 1 times [2025-03-03 20:10:56,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:56,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559771579] [2025-03-03 20:10:56,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:56,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:56,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-03-03 20:10:56,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-03-03 20:10:56,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:56,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:03,869 INFO L134 CoverageAnalysis]: Checked inductivity of 20200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20200 trivial. 0 not checked. [2025-03-03 20:11:03,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:03,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559771579] [2025-03-03 20:11:03,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559771579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:03,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:03,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 20:11:03,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28269775] [2025-03-03 20:11:03,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:03,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 20:11:03,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:03,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 20:11:03,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:11:03,873 INFO L87 Difference]: Start difference. First operand 29759 states and 48120 transitions. Second operand has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 2 states have call successors, (101), 1 states have call predecessors, (101), 1 states have return successors, (101), 2 states have call predecessors, (101), 2 states have call successors, (101)