./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-41.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-41.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 275e1054de73726fd4986d59da7aaed5f3c3f9efe879ecc32d1cc8edbd20a841 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:08:04,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:08:04,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:08:04,853 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:08:04,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:08:04,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:08:04,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:08:04,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:08:04,873 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:08:04,873 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:08:04,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:08:04,874 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:08:04,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:08:04,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:08:04,874 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:08:04,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:08:04,874 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:08:04,875 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:08:04,875 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:08:04,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:08:04,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:08:04,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:08:04,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:08:04,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:08:04,875 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:08:04,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:08:04,875 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:08:04,875 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:08:04,875 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:08:04,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:08:04,875 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:08:04,875 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:08:04,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:08:04,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:08:04,876 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:08:04,876 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:08:04,876 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:08:04,876 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:08:04,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:08:04,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:08:04,877 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:08:04,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:08:04,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:08:04,877 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 -> 275e1054de73726fd4986d59da7aaed5f3c3f9efe879ecc32d1cc8edbd20a841 [2025-03-03 20:08:05,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:08:05,109 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:08:05,111 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:08:05,112 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:08:05,112 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:08:05,113 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-41.i [2025-03-03 20:08:06,330 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a737c84c1/5c96540cc8974251b51f6666051f130d/FLAG15c3070be [2025-03-03 20:08:06,630 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:08:06,631 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-41.i [2025-03-03 20:08:06,650 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a737c84c1/5c96540cc8974251b51f6666051f130d/FLAG15c3070be [2025-03-03 20:08:06,896 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a737c84c1/5c96540cc8974251b51f6666051f130d [2025-03-03 20:08:06,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:08:06,899 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:08:06,900 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:08:06,900 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:08:06,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:08:06,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:08:06" (1/1) ... [2025-03-03 20:08:06,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191d48b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:06, skipping insertion in model container [2025-03-03 20:08:06,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:08:06" (1/1) ... [2025-03-03 20:08:06,928 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:08:07,037 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-41.i[916,929] [2025-03-03 20:08:07,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:08:07,174 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:08:07,183 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-41.i[916,929] [2025-03-03 20:08:07,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:08:07,270 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:08:07,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:07 WrapperNode [2025-03-03 20:08:07,271 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:08:07,272 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:08:07,272 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:08:07,272 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:08:07,276 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:08:07" (1/1) ... [2025-03-03 20:08:07,292 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:08:07" (1/1) ... [2025-03-03 20:08:07,354 INFO L138 Inliner]: procedures = 26, calls = 119, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 793 [2025-03-03 20:08:07,354 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:08:07,355 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:08:07,355 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:08:07,355 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:08:07,361 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:07" (1/1) ... [2025-03-03 20:08:07,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:07" (1/1) ... [2025-03-03 20:08:07,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:07" (1/1) ... [2025-03-03 20:08:07,420 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:08:07,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:07" (1/1) ... [2025-03-03 20:08:07,421 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:07" (1/1) ... [2025-03-03 20:08:07,447 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:07" (1/1) ... [2025-03-03 20:08:07,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:07" (1/1) ... [2025-03-03 20:08:07,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:07" (1/1) ... [2025-03-03 20:08:07,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:07" (1/1) ... [2025-03-03 20:08:07,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:08:07,482 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:08:07,482 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:08:07,482 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:08:07,483 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:07" (1/1) ... [2025-03-03 20:08:07,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:08:07,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:07,508 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:08:07,512 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:08:07,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:08:07,529 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:08:07,529 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:08:07,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:08:07,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:08:07,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:08:07,657 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:08:07,659 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:08:08,742 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 20:08:08,742 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:08:08,768 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:08:08,771 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-03 20:08:08,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:08:08 BoogieIcfgContainer [2025-03-03 20:08:08,771 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:08:08,773 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:08:08,773 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:08:08,776 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:08:08,777 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:08:06" (1/3) ... [2025-03-03 20:08:08,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f938706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:08:08, skipping insertion in model container [2025-03-03 20:08:08,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:08:07" (2/3) ... [2025-03-03 20:08:08,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f938706 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:08:08, skipping insertion in model container [2025-03-03 20:08:08,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:08:08" (3/3) ... [2025-03-03 20:08:08,780 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-41.i [2025-03-03 20:08:08,790 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:08:08,794 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-41.i that has 2 procedures, 331 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:08:08,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:08:08,861 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;@27ee008c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:08:08,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:08:08,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 331 states, 222 states have (on average 1.5810810810810811) internal successors, (351), 223 states have internal predecessors, (351), 106 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-03 20:08:08,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2025-03-03 20:08:08,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:08,896 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:08,897 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:08,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:08,901 INFO L85 PathProgramCache]: Analyzing trace with hash -67190136, now seen corresponding path program 1 times [2025-03-03 20:08:08,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:08,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753848064] [2025-03-03 20:08:08,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:08,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:09,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 682 statements into 1 equivalence classes. [2025-03-03 20:08:09,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 682 of 682 statements. [2025-03-03 20:08:09,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:09,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:09,518 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 22050 trivial. 0 not checked. [2025-03-03 20:08:09,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:09,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753848064] [2025-03-03 20:08:09,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753848064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:08:09,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306507283] [2025-03-03 20:08:09,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:09,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:08:09,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:08:09,524 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:08:09,525 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:08:09,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 682 statements into 1 equivalence classes. [2025-03-03 20:08:09,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 682 of 682 statements. [2025-03-03 20:08:09,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:09,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:09,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 1555 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:08:09,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:08:09,981 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 22050 trivial. 0 not checked. [2025-03-03 20:08:09,981 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:08:09,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306507283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:09,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:08:09,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:08:09,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376433345] [2025-03-03 20:08:09,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:09,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:08:09,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:10,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:08:10,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:08:10,011 INFO L87 Difference]: Start difference. First operand has 331 states, 222 states have (on average 1.5810810810810811) internal successors, (351), 223 states have internal predecessors, (351), 106 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) Second operand has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (106), 2 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 2 states have call successors, (106) [2025-03-03 20:08:10,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:10,090 INFO L93 Difference]: Finished difference Result 656 states and 1227 transitions. [2025-03-03 20:08:10,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:08:10,092 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (106), 2 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 2 states have call successors, (106) Word has length 682 [2025-03-03 20:08:10,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:10,101 INFO L225 Difference]: With dead ends: 656 [2025-03-03 20:08:10,101 INFO L226 Difference]: Without dead ends: 328 [2025-03-03 20:08:10,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 683 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:08:10,112 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:10,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 543 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:08:10,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-03 20:08:10,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-03-03 20:08:10,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 220 states have (on average 1.5545454545454545) internal successors, (342), 220 states have internal predecessors, (342), 106 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-03 20:08:10,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 554 transitions. [2025-03-03 20:08:10,192 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 554 transitions. Word has length 682 [2025-03-03 20:08:10,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:10,193 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 554 transitions. [2025-03-03 20:08:10,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (106), 2 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 2 states have call successors, (106) [2025-03-03 20:08:10,194 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 554 transitions. [2025-03-03 20:08:10,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2025-03-03 20:08:10,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:10,210 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:10,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 20:08:10,415 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:08:10,415 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:10,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:10,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1841759756, now seen corresponding path program 1 times [2025-03-03 20:08:10,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:10,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218492243] [2025-03-03 20:08:10,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:10,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:10,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 682 statements into 1 equivalence classes. [2025-03-03 20:08:10,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 682 of 682 statements. [2025-03-03 20:08:10,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:10,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:11,148 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-03-03 20:08:11,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:11,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218492243] [2025-03-03 20:08:11,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218492243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:11,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:11,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:11,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243457551] [2025-03-03 20:08:11,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:11,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:11,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:11,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:11,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:11,151 INFO L87 Difference]: Start difference. First operand 328 states and 554 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, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-03-03 20:08:11,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:11,276 INFO L93 Difference]: Finished difference Result 831 states and 1413 transitions. [2025-03-03 20:08:11,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:11,277 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, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 682 [2025-03-03 20:08:11,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:11,286 INFO L225 Difference]: With dead ends: 831 [2025-03-03 20:08:11,286 INFO L226 Difference]: Without dead ends: 506 [2025-03-03 20:08:11,287 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:08:11,288 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 295 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:11,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1100 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:08:11,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-03 20:08:11,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 503. [2025-03-03 20:08:11,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 374 states have (on average 1.6096256684491979) internal successors, (602), 375 states have internal predecessors, (602), 126 states have call successors, (126), 2 states have call predecessors, (126), 2 states have return successors, (126), 125 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-03 20:08:11,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 854 transitions. [2025-03-03 20:08:11,341 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 854 transitions. Word has length 682 [2025-03-03 20:08:11,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:11,345 INFO L471 AbstractCegarLoop]: Abstraction has 503 states and 854 transitions. [2025-03-03 20:08:11,345 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, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-03-03 20:08:11,345 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 854 transitions. [2025-03-03 20:08:11,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2025-03-03 20:08:11,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:11,357 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:11,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:08:11,358 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:11,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:11,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1760057357, now seen corresponding path program 1 times [2025-03-03 20:08:11,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:11,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406617160] [2025-03-03 20:08:11,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:11,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:11,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 682 statements into 1 equivalence classes. [2025-03-03 20:08:11,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 682 of 682 statements. [2025-03-03 20:08:11,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:11,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-03-03 20:08:11,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:11,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406617160] [2025-03-03 20:08:11,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406617160] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:11,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:11,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:11,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018822377] [2025-03-03 20:08:11,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:11,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:11,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:11,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:11,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:11,695 INFO L87 Difference]: Start difference. First operand 503 states and 854 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, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-03-03 20:08:11,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:11,812 INFO L93 Difference]: Finished difference Result 1011 states and 1712 transitions. [2025-03-03 20:08:11,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:11,813 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, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 682 [2025-03-03 20:08:11,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:11,822 INFO L225 Difference]: With dead ends: 1011 [2025-03-03 20:08:11,823 INFO L226 Difference]: Without dead ends: 511 [2025-03-03 20:08:11,825 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:08:11,826 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 284 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:11,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 1147 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:08:11,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-03 20:08:11,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 410. [2025-03-03 20:08:11,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 301 states have (on average 1.5880398671096345) internal successors, (478), 301 states have internal predecessors, (478), 106 states have call successors, (106), 2 states have call predecessors, (106), 2 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-03 20:08:11,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 690 transitions. [2025-03-03 20:08:11,868 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 690 transitions. Word has length 682 [2025-03-03 20:08:11,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:11,870 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 690 transitions. [2025-03-03 20:08:11,870 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, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-03-03 20:08:11,870 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 690 transitions. [2025-03-03 20:08:11,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2025-03-03 20:08:11,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:11,880 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:11,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:08:11,880 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:11,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:11,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1790565907, now seen corresponding path program 1 times [2025-03-03 20:08:11,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:11,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222437293] [2025-03-03 20:08:11,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:11,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:11,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 682 statements into 1 equivalence classes. [2025-03-03 20:08:11,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 682 of 682 statements. [2025-03-03 20:08:11,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:11,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:12,271 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-03-03 20:08:12,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:12,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222437293] [2025-03-03 20:08:12,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222437293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:12,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:12,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:12,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241013136] [2025-03-03 20:08:12,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:12,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:12,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:12,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:12,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:12,276 INFO L87 Difference]: Start difference. First operand 410 states and 690 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, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-03-03 20:08:12,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:12,355 INFO L93 Difference]: Finished difference Result 1224 states and 2064 transitions. [2025-03-03 20:08:12,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:12,356 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, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 682 [2025-03-03 20:08:12,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:12,365 INFO L225 Difference]: With dead ends: 1224 [2025-03-03 20:08:12,366 INFO L226 Difference]: Without dead ends: 817 [2025-03-03 20:08:12,368 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:08:12,369 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 338 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:12,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1174 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:08:12,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2025-03-03 20:08:12,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 815. [2025-03-03 20:08:12,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 598 states have (on average 1.5836120401337792) internal successors, (947), 598 states have internal predecessors, (947), 212 states have call successors, (212), 4 states have call predecessors, (212), 4 states have return successors, (212), 212 states have call predecessors, (212), 212 states have call successors, (212) [2025-03-03 20:08:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1371 transitions. [2025-03-03 20:08:12,439 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1371 transitions. Word has length 682 [2025-03-03 20:08:12,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:12,440 INFO L471 AbstractCegarLoop]: Abstraction has 815 states and 1371 transitions. [2025-03-03 20:08:12,441 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, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-03-03 20:08:12,441 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1371 transitions. [2025-03-03 20:08:12,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2025-03-03 20:08:12,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:12,445 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:12,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:08:12,446 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:12,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:12,446 INFO L85 PathProgramCache]: Analyzing trace with hash 2040263425, now seen corresponding path program 1 times [2025-03-03 20:08:12,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:12,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942316591] [2025-03-03 20:08:12,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:12,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:12,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-03-03 20:08:12,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-03-03 20:08:12,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:12,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:13,902 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-03-03 20:08:13,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:13,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942316591] [2025-03-03 20:08:13,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942316591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:13,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:13,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:08:13,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808547832] [2025-03-03 20:08:13,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:13,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:08:13,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:13,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:08:13,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:08:13,904 INFO L87 Difference]: Start difference. First operand 815 states and 1371 transitions. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-03-03 20:08:19,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:08:27,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:27,028 INFO L93 Difference]: Finished difference Result 1950 states and 3263 transitions. [2025-03-03 20:08:27,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:08:27,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 683 [2025-03-03 20:08:27,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:27,037 INFO L225 Difference]: With dead ends: 1950 [2025-03-03 20:08:27,037 INFO L226 Difference]: Without dead ends: 1543 [2025-03-03 20:08:27,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:08:27,039 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 1203 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 2162 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:27,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 2162 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 12.9s Time] [2025-03-03 20:08:27,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2025-03-03 20:08:27,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1508. [2025-03-03 20:08:27,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1068 states have (on average 1.5580524344569289) internal successors, (1664), 1071 states have internal predecessors, (1664), 428 states have call successors, (428), 11 states have call predecessors, (428), 11 states have return successors, (428), 425 states have call predecessors, (428), 428 states have call successors, (428) [2025-03-03 20:08:27,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2520 transitions. [2025-03-03 20:08:27,170 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2520 transitions. Word has length 683 [2025-03-03 20:08:27,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:27,172 INFO L471 AbstractCegarLoop]: Abstraction has 1508 states and 2520 transitions. [2025-03-03 20:08:27,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-03-03 20:08:27,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2520 transitions. [2025-03-03 20:08:27,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2025-03-03 20:08:27,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:27,178 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:27,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:08:27,181 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:27,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:27,181 INFO L85 PathProgramCache]: Analyzing trace with hash -283764414, now seen corresponding path program 1 times [2025-03-03 20:08:27,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:27,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077875076] [2025-03-03 20:08:27,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:27,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:27,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-03-03 20:08:27,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-03-03 20:08:27,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:27,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:27,904 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-03-03 20:08:27,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:27,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077875076] [2025-03-03 20:08:27,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077875076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:27,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:27,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:27,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897257272] [2025-03-03 20:08:27,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:27,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:27,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:27,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:27,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:27,908 INFO L87 Difference]: Start difference. First operand 1508 states and 2520 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, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-03-03 20:08:28,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:28,109 INFO L93 Difference]: Finished difference Result 4518 states and 7554 transitions. [2025-03-03 20:08:28,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:28,110 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, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 683 [2025-03-03 20:08:28,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:28,128 INFO L225 Difference]: With dead ends: 4518 [2025-03-03 20:08:28,128 INFO L226 Difference]: Without dead ends: 3013 [2025-03-03 20:08:28,133 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:08:28,134 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 311 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:28,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1071 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:08:28,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2025-03-03 20:08:28,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 3009. [2025-03-03 20:08:28,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3009 states, 2130 states have (on average 1.5544600938967137) internal successors, (3311), 2136 states have internal predecessors, (3311), 856 states have call successors, (856), 22 states have call predecessors, (856), 22 states have return successors, (856), 850 states have call predecessors, (856), 856 states have call successors, (856) [2025-03-03 20:08:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3009 states to 3009 states and 5023 transitions. [2025-03-03 20:08:28,390 INFO L78 Accepts]: Start accepts. Automaton has 3009 states and 5023 transitions. Word has length 683 [2025-03-03 20:08:28,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:28,390 INFO L471 AbstractCegarLoop]: Abstraction has 3009 states and 5023 transitions. [2025-03-03 20:08:28,391 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, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-03-03 20:08:28,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3009 states and 5023 transitions. [2025-03-03 20:08:28,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2025-03-03 20:08:28,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:28,396 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:28,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:08:28,397 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:28,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:28,397 INFO L85 PathProgramCache]: Analyzing trace with hash -72413501, now seen corresponding path program 1 times [2025-03-03 20:08:28,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:28,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073190605] [2025-03-03 20:08:28,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:28,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:28,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-03-03 20:08:28,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-03-03 20:08:28,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:28,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:29,042 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-03-03 20:08:29,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:29,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073190605] [2025-03-03 20:08:29,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073190605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:29,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:29,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:08:29,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110570443] [2025-03-03 20:08:29,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:29,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:08:29,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:29,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:08:29,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:08:29,044 INFO L87 Difference]: Start difference. First operand 3009 states and 5023 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, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-03-03 20:08:29,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:29,362 INFO L93 Difference]: Finished difference Result 9021 states and 15063 transitions. [2025-03-03 20:08:29,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:08:29,363 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, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 683 [2025-03-03 20:08:29,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:29,407 INFO L225 Difference]: With dead ends: 9021 [2025-03-03 20:08:29,407 INFO L226 Difference]: Without dead ends: 6015 [2025-03-03 20:08:29,420 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:08:29,421 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 309 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1077 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:29,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1077 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:08:29,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6015 states. [2025-03-03 20:08:29,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6015 to 6013. [2025-03-03 20:08:29,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6013 states, 4256 states have (on average 1.5526315789473684) internal successors, (6608), 4268 states have internal predecessors, (6608), 1712 states have call successors, (1712), 44 states have call predecessors, (1712), 44 states have return successors, (1712), 1700 states have call predecessors, (1712), 1712 states have call successors, (1712) [2025-03-03 20:08:29,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6013 states to 6013 states and 10032 transitions. [2025-03-03 20:08:29,952 INFO L78 Accepts]: Start accepts. Automaton has 6013 states and 10032 transitions. Word has length 683 [2025-03-03 20:08:29,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:29,953 INFO L471 AbstractCegarLoop]: Abstraction has 6013 states and 10032 transitions. [2025-03-03 20:08:29,953 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, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-03-03 20:08:29,954 INFO L276 IsEmpty]: Start isEmpty. Operand 6013 states and 10032 transitions. [2025-03-03 20:08:29,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2025-03-03 20:08:29,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:29,959 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:29,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:08:29,959 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:29,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:29,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1280896196, now seen corresponding path program 1 times [2025-03-03 20:08:29,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:29,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803789394] [2025-03-03 20:08:29,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:29,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:29,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-03-03 20:08:30,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-03-03 20:08:30,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:30,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:31,888 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-03-03 20:08:31,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:31,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803789394] [2025-03-03 20:08:31,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803789394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:31,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:31,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 20:08:31,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341665699] [2025-03-03 20:08:31,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:31,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 20:08:31,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:31,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 20:08:31,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:08:31,891 INFO L87 Difference]: Start difference. First operand 6013 states and 10032 transitions. Second operand has 9 states, 9 states have (on average 17.333333333333332) internal successors, (156), 9 states have internal predecessors, (156), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-03-03 20:08:35,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:35,323 INFO L93 Difference]: Finished difference Result 36144 states and 60431 transitions. [2025-03-03 20:08:35,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 20:08:35,324 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), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 683 [2025-03-03 20:08:35,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:35,451 INFO L225 Difference]: With dead ends: 36144 [2025-03-03 20:08:35,452 INFO L226 Difference]: Without dead ends: 30134 [2025-03-03 20:08:35,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:08:35,480 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 3217 mSDsluCounter, 4471 mSDsCounter, 0 mSdLazyCounter, 1631 mSolverCounterSat, 378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3217 SdHoareTripleChecker+Valid, 5250 SdHoareTripleChecker+Invalid, 2009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 1631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:35,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3217 Valid, 5250 Invalid, 2009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [378 Valid, 1631 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 20:08:35,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30134 states. [2025-03-03 20:08:36,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30134 to 21731. [2025-03-03 20:08:36,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21731 states, 17362 states have (on average 1.6146757286026956) internal successors, (28034), 17427 states have internal predecessors, (28034), 4160 states have call successors, (4160), 208 states have call predecessors, (4160), 208 states have return successors, (4160), 4095 states have call predecessors, (4160), 4160 states have call successors, (4160) [2025-03-03 20:08:36,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21731 states to 21731 states and 36354 transitions. [2025-03-03 20:08:37,001 INFO L78 Accepts]: Start accepts. Automaton has 21731 states and 36354 transitions. Word has length 683 [2025-03-03 20:08:37,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:37,002 INFO L471 AbstractCegarLoop]: Abstraction has 21731 states and 36354 transitions. [2025-03-03 20:08:37,004 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), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-03-03 20:08:37,004 INFO L276 IsEmpty]: Start isEmpty. Operand 21731 states and 36354 transitions. [2025-03-03 20:08:37,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2025-03-03 20:08:37,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:37,016 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:37,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:08:37,017 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:37,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:37,018 INFO L85 PathProgramCache]: Analyzing trace with hash -649722909, now seen corresponding path program 1 times [2025-03-03 20:08:37,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:37,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646572052] [2025-03-03 20:08:37,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:37,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:37,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-03-03 20:08:37,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-03-03 20:08:37,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:37,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:37,319 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-03-03 20:08:37,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:37,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646572052] [2025-03-03 20:08:37,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646572052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:37,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:37,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:08:37,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054895094] [2025-03-03 20:08:37,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:37,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:08:37,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:37,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:08:37,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:08:37,322 INFO L87 Difference]: Start difference. First operand 21731 states and 36354 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-03-03 20:08:40,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:40,088 INFO L93 Difference]: Finished difference Result 71051 states and 119445 transitions. [2025-03-03 20:08:40,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:08:40,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 683 [2025-03-03 20:08:40,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:40,229 INFO L225 Difference]: With dead ends: 71051 [2025-03-03 20:08:40,229 INFO L226 Difference]: Without dead ends: 49109 [2025-03-03 20:08:40,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:08:40,281 INFO L435 NwaCegarLoop]: 1022 mSDtfsCounter, 1120 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 2326 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:40,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 2326 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:08:40,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49109 states. [2025-03-03 20:08:42,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49109 to 32317. [2025-03-03 20:08:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32317 states, 25788 states have (on average 1.6142391810144252) internal successors, (41628), 25884 states have internal predecessors, (41628), 6216 states have call successors, (6216), 312 states have call predecessors, (6216), 312 states have return successors, (6216), 6120 states have call predecessors, (6216), 6216 states have call successors, (6216) [2025-03-03 20:08:42,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32317 states to 32317 states and 54060 transitions. [2025-03-03 20:08:42,545 INFO L78 Accepts]: Start accepts. Automaton has 32317 states and 54060 transitions. Word has length 683 [2025-03-03 20:08:42,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:42,546 INFO L471 AbstractCegarLoop]: Abstraction has 32317 states and 54060 transitions. [2025-03-03 20:08:42,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-03-03 20:08:42,546 INFO L276 IsEmpty]: Start isEmpty. Operand 32317 states and 54060 transitions. [2025-03-03 20:08:42,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2025-03-03 20:08:42,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:42,563 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:42,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:08:42,563 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:42,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:42,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1118649095, now seen corresponding path program 1 times [2025-03-03 20:08:42,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:42,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810524975] [2025-03-03 20:08:42,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:42,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:42,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-03-03 20:08:42,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-03-03 20:08:42,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:42,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:08:45,829 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-03-03 20:08:45,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:08:45,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810524975] [2025-03-03 20:08:45,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810524975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:08:45,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:08:45,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 20:08:45,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571201126] [2025-03-03 20:08:45,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:08:45,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:08:45,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:08:45,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:08:45,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:08:45,832 INFO L87 Difference]: Start difference. First operand 32317 states and 54060 transitions. Second operand has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 2 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 2 states have call predecessors, (106), 2 states have call successors, (106) [2025-03-03 20:08:54,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:08:54,088 INFO L93 Difference]: Finished difference Result 122851 states and 204433 transitions. [2025-03-03 20:08:54,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 20:08:54,088 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 2 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 2 states have call predecessors, (106), 2 states have call successors, (106) Word has length 683 [2025-03-03 20:08:54,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:08:54,375 INFO L225 Difference]: With dead ends: 122851 [2025-03-03 20:08:54,376 INFO L226 Difference]: Without dead ends: 89665 [2025-03-03 20:08:54,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2025-03-03 20:08:54,441 INFO L435 NwaCegarLoop]: 792 mSDtfsCounter, 4662 mSDsluCounter, 1788 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 771 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4662 SdHoareTripleChecker+Valid, 2580 SdHoareTripleChecker+Invalid, 2549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 771 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:08:54,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4662 Valid, 2580 Invalid, 2549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [771 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-03 20:08:54,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89665 states. [2025-03-03 20:08:58,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89665 to 28174. [2025-03-03 20:08:58,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28174 states, 20970 states have (on average 1.561182641869337) internal successors, (32738), 21019 states have internal predecessors, (32738), 6866 states have call successors, (6866), 337 states have call predecessors, (6866), 337 states have return successors, (6866), 6817 states have call predecessors, (6866), 6866 states have call successors, (6866) [2025-03-03 20:08:58,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28174 states to 28174 states and 46470 transitions. [2025-03-03 20:08:58,961 INFO L78 Accepts]: Start accepts. Automaton has 28174 states and 46470 transitions. Word has length 683 [2025-03-03 20:08:58,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:08:58,962 INFO L471 AbstractCegarLoop]: Abstraction has 28174 states and 46470 transitions. [2025-03-03 20:08:58,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 2 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 2 states have call predecessors, (106), 2 states have call successors, (106) [2025-03-03 20:08:58,962 INFO L276 IsEmpty]: Start isEmpty. Operand 28174 states and 46470 transitions. [2025-03-03 20:08:58,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2025-03-03 20:08:58,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:08:58,980 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:58,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:08:58,981 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:08:58,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:08:58,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1245699096, now seen corresponding path program 1 times [2025-03-03 20:08:58,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:08:58,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606240544] [2025-03-03 20:08:58,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:08:58,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:08:59,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-03-03 20:08:59,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-03-03 20:08:59,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:08:59,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:01,369 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-03-03 20:09:01,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:01,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606240544] [2025-03-03 20:09:01,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606240544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:01,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:01,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 20:09:01,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001003816] [2025-03-03 20:09:01,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:01,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 20:09:01,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:01,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 20:09:01,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:09:01,373 INFO L87 Difference]: Start difference. First operand 28174 states and 46470 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, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 2 states have call predecessors, (106), 2 states have call successors, (106) [2025-03-03 20:09:10,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:10,107 INFO L93 Difference]: Finished difference Result 84142 states and 138806 transitions. [2025-03-03 20:09:10,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 20:09:10,108 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, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 2 states have call predecessors, (106), 2 states have call successors, (106) Word has length 683 [2025-03-03 20:09:10,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:10,283 INFO L225 Difference]: With dead ends: 84142 [2025-03-03 20:09:10,283 INFO L226 Difference]: Without dead ends: 56004 [2025-03-03 20:09:10,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2025-03-03 20:09:10,352 INFO L435 NwaCegarLoop]: 1253 mSDtfsCounter, 3572 mSDsluCounter, 1745 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 716 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3572 SdHoareTripleChecker+Valid, 2998 SdHoareTripleChecker+Invalid, 3247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 716 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:10,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3572 Valid, 2998 Invalid, 3247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [716 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-03 20:09:10,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56004 states. [2025-03-03 20:09:13,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56004 to 21582. [2025-03-03 20:09:13,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21582 states, 16054 states have (on average 1.5476516755948673) internal successors, (24846), 16091 states have internal predecessors, (24846), 5212 states have call successors, (5212), 315 states have call predecessors, (5212), 315 states have return successors, (5212), 5175 states have call predecessors, (5212), 5212 states have call successors, (5212) [2025-03-03 20:09:13,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21582 states to 21582 states and 35270 transitions. [2025-03-03 20:09:13,319 INFO L78 Accepts]: Start accepts. Automaton has 21582 states and 35270 transitions. Word has length 683 [2025-03-03 20:09:13,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:09:13,320 INFO L471 AbstractCegarLoop]: Abstraction has 21582 states and 35270 transitions. [2025-03-03 20:09:13,320 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, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 2 states have call predecessors, (106), 2 states have call successors, (106) [2025-03-03 20:09:13,320 INFO L276 IsEmpty]: Start isEmpty. Operand 21582 states and 35270 transitions. [2025-03-03 20:09:13,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2025-03-03 20:09:13,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:09:13,330 INFO L218 NwaCegarLoop]: trace histogram [106, 106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:13,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:09:13,330 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:09:13,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:09:13,331 INFO L85 PathProgramCache]: Analyzing trace with hash 133656066, now seen corresponding path program 1 times [2025-03-03 20:09:13,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:09:13,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893865854] [2025-03-03 20:09:13,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:09:13,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:09:13,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 683 statements into 1 equivalence classes. [2025-03-03 20:09:13,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 683 of 683 statements. [2025-03-03 20:09:13,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:09:13,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:09:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 22260 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22260 trivial. 0 not checked. [2025-03-03 20:09:15,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:09:15,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893865854] [2025-03-03 20:09:15,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893865854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:09:15,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:09:15,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 20:09:15,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196513064] [2025-03-03 20:09:15,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:09:15,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 20:09:15,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:09:15,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 20:09:15,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:09:15,294 INFO L87 Difference]: Start difference. First operand 21582 states and 35270 transitions. Second operand has 11 states, 11 states have (on average 14.181818181818182) internal successors, (156), 11 states have internal predecessors, (156), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) [2025-03-03 20:09:22,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:09:22,095 INFO L93 Difference]: Finished difference Result 63470 states and 104816 transitions. [2025-03-03 20:09:22,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:09:22,096 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.181818181818182) internal successors, (156), 11 states have internal predecessors, (156), 1 states have call successors, (106), 1 states have call predecessors, (106), 1 states have return successors, (106), 1 states have call predecessors, (106), 1 states have call successors, (106) Word has length 683 [2025-03-03 20:09:22,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:09:22,223 INFO L225 Difference]: With dead ends: 63470 [2025-03-03 20:09:22,224 INFO L226 Difference]: Without dead ends: 41544 [2025-03-03 20:09:22,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2025-03-03 20:09:22,272 INFO L435 NwaCegarLoop]: 879 mSDtfsCounter, 1679 mSDsluCounter, 5152 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1679 SdHoareTripleChecker+Valid, 6031 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 20:09:22,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1679 Valid, 6031 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1696 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]