./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-34.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 11f663f31fd7e407dcb664c9f5df2c771bffa1ce1600c8629f9e6c1a07759991 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:52:53,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:52:53,810 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:52:53,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:52:53,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:52:53,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:52:53,835 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:52:53,835 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:52:53,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:52:53,835 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:52:53,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:52:53,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:52:53,836 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:52:53,836 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:52:53,836 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:52:53,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:52:53,836 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:52:53,836 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:52:53,836 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:52:53,836 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:52:53,836 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:52:53,836 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:52:53,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:52:53,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:52:53,836 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:52:53,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:52:53,836 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:52:53,836 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:52:53,836 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:52:53,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:52:53,837 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:52:53,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:52:53,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:52:53,837 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:52:53,837 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:52:53,837 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:52:53,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:52:53,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:52:53,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:52:53,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:52:53,837 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:52:53,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:52:53,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:52:53,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:52:53,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:52:53,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:52:53,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:52:53,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:52:53,838 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-jdk21/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 -> 11f663f31fd7e407dcb664c9f5df2c771bffa1ce1600c8629f9e6c1a07759991 [2025-01-09 09:52:54,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:52:54,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:52:54,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:52:54,081 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:52:54,081 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:52:54,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-34.i [2025-01-09 09:52:55,264 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d52f198c/491ecd6d26194a80a03b5819f1938c19/FLAGa853acb7b [2025-01-09 09:52:55,544 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:52:55,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-34.i [2025-01-09 09:52:55,557 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d52f198c/491ecd6d26194a80a03b5819f1938c19/FLAGa853acb7b [2025-01-09 09:52:55,846 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d52f198c/491ecd6d26194a80a03b5819f1938c19 [2025-01-09 09:52:55,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:52:55,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:52:55,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:52:55,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:52:55,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:52:55,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:52:55" (1/1) ... [2025-01-09 09:52:55,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74f677aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:55, skipping insertion in model container [2025-01-09 09:52:55,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:52:55" (1/1) ... [2025-01-09 09:52:55,868 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:52:55,962 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-34.i[915,928] [2025-01-09 09:52:56,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:52:56,040 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:52:56,052 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-34.i[915,928] [2025-01-09 09:52:56,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:52:56,101 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:52:56,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56 WrapperNode [2025-01-09 09:52:56,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:52:56,104 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:52:56,104 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:52:56,104 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:52:56,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:56,118 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:56,159 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2025-01-09 09:52:56,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:52:56,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:52:56,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:52:56,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:52:56,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:56,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:56,172 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:56,183 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-01-09 09:52:56,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:56,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:56,190 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:56,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:56,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:56,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:56,198 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:56,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:52:56,201 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:52:56,202 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:52:56,202 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:52:56,203 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (1/1) ... [2025-01-09 09:52:56,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:52:56,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:52:56,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 09:52:56,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 09:52:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:52:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:52:56,249 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:52:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:52:56,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:52:56,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:52:56,331 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:52:56,332 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:52:56,651 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-01-09 09:52:56,652 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:52:56,660 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:52:56,663 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:52:56,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:52:56 BoogieIcfgContainer [2025-01-09 09:52:56,663 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:52:56,665 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:52:56,665 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:52:56,669 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:52:56,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:52:55" (1/3) ... [2025-01-09 09:52:56,670 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c11bda2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:52:56, skipping insertion in model container [2025-01-09 09:52:56,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:52:56" (2/3) ... [2025-01-09 09:52:56,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c11bda2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:52:56, skipping insertion in model container [2025-01-09 09:52:56,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:52:56" (3/3) ... [2025-01-09 09:52:56,673 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-34.i [2025-01-09 09:52:56,684 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:52:56,686 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-34.i that has 2 procedures, 98 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:52:56,728 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:52:56,737 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;@28de1ea7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:52:56,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:52:56,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 09:52:56,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 09:52:56,751 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:52:56,753 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:52:56,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:52:56,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:52:56,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1634179896, now seen corresponding path program 1 times [2025-01-09 09:52:56,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:52:56,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99044654] [2025-01-09 09:52:56,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:52:56,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:52:56,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 09:52:56,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 09:52:56,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:52:56,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:52:57,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-01-09 09:52:57,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:52:57,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99044654] [2025-01-09 09:52:57,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99044654] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:52:57,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793569525] [2025-01-09 09:52:57,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:52:57,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:52:57,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:52:57,099 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:52:57,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 09:52:57,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 09:52:57,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 09:52:57,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:52:57,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:52:57,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:52:57,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:52:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2025-01-09 09:52:57,303 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:52:57,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793569525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:52:57,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:52:57,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:52:57,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500670849] [2025-01-09 09:52:57,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:52:57,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:52:57,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:52:57,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:52:57,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:52:57,326 INFO L87 Difference]: Start difference. First operand has 98 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 09:52:57,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:52:57,345 INFO L93 Difference]: Finished difference Result 190 states and 328 transitions. [2025-01-09 09:52:57,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:52:57,347 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 177 [2025-01-09 09:52:57,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:52:57,351 INFO L225 Difference]: With dead ends: 190 [2025-01-09 09:52:57,352 INFO L226 Difference]: Without dead ends: 95 [2025-01-09 09:52:57,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 178 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-01-09 09:52:57,356 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:52:57,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:52:57,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-09 09:52:57,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-01-09 09:52:57,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2025-01-09 09:52:57,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 148 transitions. [2025-01-09 09:52:57,390 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 148 transitions. Word has length 177 [2025-01-09 09:52:57,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:52:57,390 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 148 transitions. [2025-01-09 09:52:57,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (27), 2 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 09:52:57,391 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 148 transitions. [2025-01-09 09:52:57,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 09:52:57,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:52:57,393 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:52:57,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 09:52:57,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 09:52:57,598 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:52:57,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:52:57,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1801990134, now seen corresponding path program 1 times [2025-01-09 09:52:57,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:52:57,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207046645] [2025-01-09 09:52:57,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:52:57,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:52:57,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 09:52:57,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 09:52:57,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:52:57,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:52:57,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 09:52:57,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:52:57,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207046645] [2025-01-09 09:52:57,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207046645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:52:57,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:52:57,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:52:57,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49882306] [2025-01-09 09:52:57,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:52:57,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:52:57,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:52:57,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:52:57,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:52:57,965 INFO L87 Difference]: Start difference. First operand 95 states and 148 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:52:58,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:52:58,019 INFO L93 Difference]: Finished difference Result 279 states and 438 transitions. [2025-01-09 09:52:58,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:52:58,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2025-01-09 09:52:58,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:52:58,022 INFO L225 Difference]: With dead ends: 279 [2025-01-09 09:52:58,022 INFO L226 Difference]: Without dead ends: 187 [2025-01-09 09:52:58,023 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-01-09 09:52:58,026 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 143 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:52:58,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 370 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:52:58,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-01-09 09:52:58,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2025-01-09 09:52:58,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 128 states have (on average 1.4296875) internal successors, (183), 128 states have internal predecessors, (183), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 09:52:58,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 291 transitions. [2025-01-09 09:52:58,068 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 291 transitions. Word has length 177 [2025-01-09 09:52:58,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:52:58,068 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 291 transitions. [2025-01-09 09:52:58,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:52:58,068 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 291 transitions. [2025-01-09 09:52:58,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 09:52:58,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:52:58,070 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:52:58,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:52:58,073 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:52:58,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:52:58,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1379288308, now seen corresponding path program 1 times [2025-01-09 09:52:58,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:52:58,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100916259] [2025-01-09 09:52:58,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:52:58,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:52:58,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 09:52:58,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 09:52:58,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:52:58,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:52:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 09:52:58,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:52:58,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100916259] [2025-01-09 09:52:58,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100916259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:52:58,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:52:58,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:52:58,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946985433] [2025-01-09 09:52:58,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:52:58,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:52:58,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:52:58,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:52:58,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:52:58,383 INFO L87 Difference]: Start difference. First operand 185 states and 291 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:52:58,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:52:58,569 INFO L93 Difference]: Finished difference Result 607 states and 956 transitions. [2025-01-09 09:52:58,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:52:58,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 177 [2025-01-09 09:52:58,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:52:58,575 INFO L225 Difference]: With dead ends: 607 [2025-01-09 09:52:58,576 INFO L226 Difference]: Without dead ends: 425 [2025-01-09 09:52:58,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:52:58,580 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 154 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:52:58,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 462 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:52:58,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-01-09 09:52:58,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 369. [2025-01-09 09:52:58,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 256 states have (on average 1.421875) internal successors, (364), 256 states have internal predecessors, (364), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 09:52:58,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 580 transitions. [2025-01-09 09:52:58,671 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 580 transitions. Word has length 177 [2025-01-09 09:52:58,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:52:58,673 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 580 transitions. [2025-01-09 09:52:58,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:52:58,673 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 580 transitions. [2025-01-09 09:52:58,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 09:52:58,678 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:52:58,678 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:52:58,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:52:58,678 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:52:58,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:52:58,679 INFO L85 PathProgramCache]: Analyzing trace with hash -668521514, now seen corresponding path program 1 times [2025-01-09 09:52:58,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:52:58,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812377717] [2025-01-09 09:52:58,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:52:58,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:52:58,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 09:52:58,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 09:52:58,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:52:58,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:52:58,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 09:52:58,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:52:58,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812377717] [2025-01-09 09:52:58,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812377717] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:52:58,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:52:58,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:52:58,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147969649] [2025-01-09 09:52:58,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:52:58,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:52:58,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:52:58,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:52:58,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:52:58,965 INFO L87 Difference]: Start difference. First operand 369 states and 580 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:52:59,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:52:59,298 INFO L93 Difference]: Finished difference Result 1090 states and 1711 transitions. [2025-01-09 09:52:59,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:52:59,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 178 [2025-01-09 09:52:59,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:52:59,305 INFO L225 Difference]: With dead ends: 1090 [2025-01-09 09:52:59,306 INFO L226 Difference]: Without dead ends: 724 [2025-01-09 09:52:59,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:52:59,308 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 225 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:52:59,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 456 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:52:59,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-01-09 09:52:59,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 377. [2025-01-09 09:52:59,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 264 states have (on average 1.4090909090909092) internal successors, (372), 264 states have internal predecessors, (372), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 09:52:59,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 588 transitions. [2025-01-09 09:52:59,391 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 588 transitions. Word has length 178 [2025-01-09 09:52:59,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:52:59,392 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 588 transitions. [2025-01-09 09:52:59,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:52:59,392 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 588 transitions. [2025-01-09 09:52:59,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 09:52:59,395 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:52:59,395 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:52:59,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:52:59,396 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:52:59,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:52:59,396 INFO L85 PathProgramCache]: Analyzing trace with hash 840357876, now seen corresponding path program 1 times [2025-01-09 09:52:59,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:52:59,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019912807] [2025-01-09 09:52:59,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:52:59,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:52:59,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 09:52:59,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 09:52:59,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:52:59,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:53:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 09:53:02,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:53:02,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019912807] [2025-01-09 09:53:02,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019912807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:53:02,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:53:02,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 09:53:02,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972100207] [2025-01-09 09:53:02,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:53:02,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 09:53:02,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:53:02,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 09:53:02,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:53:02,979 INFO L87 Difference]: Start difference. First operand 377 states and 588 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:53:07,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:53:07,107 INFO L93 Difference]: Finished difference Result 1142 states and 1724 transitions. [2025-01-09 09:53:07,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 09:53:07,109 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 179 [2025-01-09 09:53:07,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:53:07,114 INFO L225 Difference]: With dead ends: 1142 [2025-01-09 09:53:07,114 INFO L226 Difference]: Without dead ends: 768 [2025-01-09 09:53:07,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2025-01-09 09:53:07,116 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 526 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:53:07,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 514 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 09:53:07,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-01-09 09:53:07,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 513. [2025-01-09 09:53:07,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 376 states have (on average 1.3936170212765957) internal successors, (524), 380 states have internal predecessors, (524), 128 states have call successors, (128), 8 states have call predecessors, (128), 8 states have return successors, (128), 124 states have call predecessors, (128), 128 states have call successors, (128) [2025-01-09 09:53:07,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 780 transitions. [2025-01-09 09:53:07,168 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 780 transitions. Word has length 179 [2025-01-09 09:53:07,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:53:07,170 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 780 transitions. [2025-01-09 09:53:07,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:53:07,172 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 780 transitions. [2025-01-09 09:53:07,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 09:53:07,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:53:07,173 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:53:07,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:53:07,173 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:53:07,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:53:07,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1679602058, now seen corresponding path program 1 times [2025-01-09 09:53:07,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:53:07,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058843897] [2025-01-09 09:53:07,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:53:07,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:53:07,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 09:53:07,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 09:53:07,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:53:07,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:53:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 09:53:09,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:53:09,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058843897] [2025-01-09 09:53:09,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058843897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:53:09,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:53:09,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 09:53:09,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097648313] [2025-01-09 09:53:09,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:53:09,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:53:09,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:53:09,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:53:09,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:53:09,509 INFO L87 Difference]: Start difference. First operand 513 states and 780 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:53:10,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:53:10,566 INFO L93 Difference]: Finished difference Result 1743 states and 2618 transitions. [2025-01-09 09:53:10,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 09:53:10,566 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 179 [2025-01-09 09:53:10,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:53:10,573 INFO L225 Difference]: With dead ends: 1743 [2025-01-09 09:53:10,573 INFO L226 Difference]: Without dead ends: 1233 [2025-01-09 09:53:10,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:53:10,577 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 387 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:53:10,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 612 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 09:53:10,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2025-01-09 09:53:10,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 671. [2025-01-09 09:53:10,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 506 states have (on average 1.4031620553359683) internal successors, (710), 510 states have internal predecessors, (710), 155 states have call successors, (155), 9 states have call predecessors, (155), 9 states have return successors, (155), 151 states have call predecessors, (155), 155 states have call successors, (155) [2025-01-09 09:53:10,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1020 transitions. [2025-01-09 09:53:10,654 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 1020 transitions. Word has length 179 [2025-01-09 09:53:10,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:53:10,655 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 1020 transitions. [2025-01-09 09:53:10,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:53:10,655 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 1020 transitions. [2025-01-09 09:53:10,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 09:53:10,657 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:53:10,658 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:53:10,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:53:10,658 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:53:10,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:53:10,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1520416246, now seen corresponding path program 1 times [2025-01-09 09:53:10,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:53:10,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612566779] [2025-01-09 09:53:10,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:53:10,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:53:10,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 09:53:10,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 09:53:10,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:53:10,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:53:13,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 09:53:13,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:53:13,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612566779] [2025-01-09 09:53:13,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612566779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:53:13,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:53:13,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 09:53:13,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127508990] [2025-01-09 09:53:13,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:53:13,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 09:53:13,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:53:13,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 09:53:13,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:53:13,788 INFO L87 Difference]: Start difference. First operand 671 states and 1020 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:53:14,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:53:14,571 INFO L93 Difference]: Finished difference Result 1847 states and 2748 transitions. [2025-01-09 09:53:14,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 09:53:14,571 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 179 [2025-01-09 09:53:14,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:53:14,576 INFO L225 Difference]: With dead ends: 1847 [2025-01-09 09:53:14,576 INFO L226 Difference]: Without dead ends: 1251 [2025-01-09 09:53:14,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:53:14,578 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 354 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:53:14,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 564 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 09:53:14,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2025-01-09 09:53:14,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 977. [2025-01-09 09:53:14,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 812 states have (on average 1.4261083743842364) internal successors, (1158), 816 states have internal predecessors, (1158), 155 states have call successors, (155), 9 states have call predecessors, (155), 9 states have return successors, (155), 151 states have call predecessors, (155), 155 states have call successors, (155) [2025-01-09 09:53:14,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1468 transitions. [2025-01-09 09:53:14,630 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1468 transitions. Word has length 179 [2025-01-09 09:53:14,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:53:14,630 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1468 transitions. [2025-01-09 09:53:14,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:53:14,631 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1468 transitions. [2025-01-09 09:53:14,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 09:53:14,632 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:53:14,633 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:53:14,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:53:14,633 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:53:14,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:53:14,633 INFO L85 PathProgramCache]: Analyzing trace with hash -429775195, now seen corresponding path program 1 times [2025-01-09 09:53:14,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:53:14,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86906325] [2025-01-09 09:53:14,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:53:14,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:53:14,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 09:53:14,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 09:53:14,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:53:14,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:53:15,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 09:53:15,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:53:15,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86906325] [2025-01-09 09:53:15,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86906325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:53:15,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:53:15,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:53:15,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507301501] [2025-01-09 09:53:15,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:53:15,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:53:15,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:53:15,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:53:15,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:53:15,760 INFO L87 Difference]: Start difference. First operand 977 states and 1468 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:53:16,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:53:16,106 INFO L93 Difference]: Finished difference Result 1927 states and 2867 transitions. [2025-01-09 09:53:16,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:53:16,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 179 [2025-01-09 09:53:16,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:53:16,114 INFO L225 Difference]: With dead ends: 1927 [2025-01-09 09:53:16,115 INFO L226 Difference]: Without dead ends: 1325 [2025-01-09 09:53:16,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:53:16,118 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 197 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:53:16,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 524 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:53:16,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2025-01-09 09:53:16,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 989. [2025-01-09 09:53:16,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 824 states have (on average 1.4150485436893203) internal successors, (1166), 828 states have internal predecessors, (1166), 155 states have call successors, (155), 9 states have call predecessors, (155), 9 states have return successors, (155), 151 states have call predecessors, (155), 155 states have call successors, (155) [2025-01-09 09:53:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1476 transitions. [2025-01-09 09:53:16,171 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1476 transitions. Word has length 179 [2025-01-09 09:53:16,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:53:16,171 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1476 transitions. [2025-01-09 09:53:16,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:53:16,172 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1476 transitions. [2025-01-09 09:53:16,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 09:53:16,175 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:53:16,175 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:53:16,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:53:16,176 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:53:16,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:53:16,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1604247988, now seen corresponding path program 1 times [2025-01-09 09:53:16,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:53:16,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442666449] [2025-01-09 09:53:16,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:53:16,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:53:16,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 09:53:16,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 09:53:16,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:53:16,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:53:16,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 09:53:16,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:53:16,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442666449] [2025-01-09 09:53:16,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442666449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:53:16,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:53:16,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:53:16,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490218988] [2025-01-09 09:53:16,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:53:16,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:53:16,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:53:16,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:53:16,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:53:16,429 INFO L87 Difference]: Start difference. First operand 989 states and 1476 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:53:16,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:53:16,645 INFO L93 Difference]: Finished difference Result 1729 states and 2578 transitions. [2025-01-09 09:53:16,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:53:16,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 179 [2025-01-09 09:53:16,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:53:16,652 INFO L225 Difference]: With dead ends: 1729 [2025-01-09 09:53:16,652 INFO L226 Difference]: Without dead ends: 1011 [2025-01-09 09:53:16,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:53:16,655 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 106 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:53:16,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 371 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:53:16,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-01-09 09:53:16,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 905. [2025-01-09 09:53:16,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 740 states have (on average 1.3810810810810812) internal successors, (1022), 744 states have internal predecessors, (1022), 155 states have call successors, (155), 9 states have call predecessors, (155), 9 states have return successors, (155), 151 states have call predecessors, (155), 155 states have call successors, (155) [2025-01-09 09:53:16,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1332 transitions. [2025-01-09 09:53:16,707 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1332 transitions. Word has length 179 [2025-01-09 09:53:16,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:53:16,708 INFO L471 AbstractCegarLoop]: Abstraction has 905 states and 1332 transitions. [2025-01-09 09:53:16,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:53:16,708 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1332 transitions. [2025-01-09 09:53:16,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 09:53:16,710 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:53:16,710 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:53:16,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:53:16,710 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:53:16,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:53:16,710 INFO L85 PathProgramCache]: Analyzing trace with hash -449255381, now seen corresponding path program 1 times [2025-01-09 09:53:16,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:53:16,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134041836] [2025-01-09 09:53:16,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:53:16,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:53:16,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 09:53:16,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 09:53:16,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:53:16,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:53:18,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 09:53:18,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:53:18,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134041836] [2025-01-09 09:53:18,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134041836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:53:18,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:53:18,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 09:53:18,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47904777] [2025-01-09 09:53:18,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:53:18,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:53:18,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:53:18,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:53:18,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:53:18,652 INFO L87 Difference]: Start difference. First operand 905 states and 1332 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:53:19,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:53:19,997 INFO L93 Difference]: Finished difference Result 1821 states and 2674 transitions. [2025-01-09 09:53:19,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 09:53:19,998 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 180 [2025-01-09 09:53:20,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:53:20,006 INFO L225 Difference]: With dead ends: 1821 [2025-01-09 09:53:20,006 INFO L226 Difference]: Without dead ends: 1311 [2025-01-09 09:53:20,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-01-09 09:53:20,010 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 309 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:53:20,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 483 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 09:53:20,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1311 states. [2025-01-09 09:53:20,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1311 to 765. [2025-01-09 09:53:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 620 states have (on average 1.3774193548387097) internal successors, (854), 620 states have internal predecessors, (854), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 09:53:20,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1124 transitions. [2025-01-09 09:53:20,076 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1124 transitions. Word has length 180 [2025-01-09 09:53:20,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:53:20,077 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1124 transitions. [2025-01-09 09:53:20,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:53:20,077 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1124 transitions. [2025-01-09 09:53:20,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 09:53:20,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:53:20,079 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:53:20,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:53:20,079 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:53:20,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:53:20,080 INFO L85 PathProgramCache]: Analyzing trace with hash -604288863, now seen corresponding path program 1 times [2025-01-09 09:53:20,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:53:20,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749928028] [2025-01-09 09:53:20,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:53:20,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:53:20,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 09:53:20,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 09:53:20,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:53:20,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:53:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 09:53:24,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:53:24,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749928028] [2025-01-09 09:53:24,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749928028] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:53:24,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:53:24,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 09:53:24,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696283142] [2025-01-09 09:53:24,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:53:24,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 09:53:24,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:53:24,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 09:53:24,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:53:24,350 INFO L87 Difference]: Start difference. First operand 765 states and 1124 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:53:26,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:53:26,319 INFO L93 Difference]: Finished difference Result 1651 states and 2389 transitions. [2025-01-09 09:53:26,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 09:53:26,319 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 180 [2025-01-09 09:53:26,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:53:26,323 INFO L225 Difference]: With dead ends: 1651 [2025-01-09 09:53:26,324 INFO L226 Difference]: Without dead ends: 1137 [2025-01-09 09:53:26,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2025-01-09 09:53:26,325 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 225 mSDsluCounter, 893 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:53:26,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 1052 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 09:53:26,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2025-01-09 09:53:26,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 839. [2025-01-09 09:53:26,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 694 states have (on average 1.3804034582132565) internal successors, (958), 694 states have internal predecessors, (958), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 09:53:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1228 transitions. [2025-01-09 09:53:26,368 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1228 transitions. Word has length 180 [2025-01-09 09:53:26,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:53:26,369 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1228 transitions. [2025-01-09 09:53:26,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:53:26,369 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1228 transitions. [2025-01-09 09:53:26,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 09:53:26,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:53:26,371 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:53:26,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 09:53:26,371 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:53:26,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:53:26,371 INFO L85 PathProgramCache]: Analyzing trace with hash -952326593, now seen corresponding path program 1 times [2025-01-09 09:53:26,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:53:26,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698125334] [2025-01-09 09:53:26,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:53:26,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:53:26,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 09:53:26,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 09:53:26,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:53:26,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:53:31,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 09:53:31,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:53:31,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698125334] [2025-01-09 09:53:31,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698125334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:53:31,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:53:31,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 09:53:31,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940074734] [2025-01-09 09:53:31,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:53:31,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 09:53:31,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:53:31,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 09:53:31,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:53:31,678 INFO L87 Difference]: Start difference. First operand 839 states and 1228 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:53:33,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:53:33,732 INFO L93 Difference]: Finished difference Result 1429 states and 2069 transitions. [2025-01-09 09:53:33,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 09:53:33,733 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-01-09 09:53:33,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:53:33,737 INFO L225 Difference]: With dead ends: 1429 [2025-01-09 09:53:33,738 INFO L226 Difference]: Without dead ends: 1019 [2025-01-09 09:53:33,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=164, Invalid=486, Unknown=0, NotChecked=0, Total=650 [2025-01-09 09:53:33,740 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 402 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:53:33,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 788 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 09:53:33,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2025-01-09 09:53:33,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 819. [2025-01-09 09:53:33,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 674 states have (on average 1.3857566765578635) internal successors, (934), 674 states have internal predecessors, (934), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 09:53:33,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1204 transitions. [2025-01-09 09:53:33,801 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1204 transitions. Word has length 181 [2025-01-09 09:53:33,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:53:33,802 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1204 transitions. [2025-01-09 09:53:33,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:53:33,802 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1204 transitions. [2025-01-09 09:53:33,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 09:53:33,804 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:53:33,804 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:53:33,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 09:53:33,804 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:53:33,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:53:33,805 INFO L85 PathProgramCache]: Analyzing trace with hash 2117805811, now seen corresponding path program 1 times [2025-01-09 09:53:33,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:53:33,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672331023] [2025-01-09 09:53:33,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:53:33,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:53:33,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 09:53:33,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 09:53:33,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:53:33,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:53:40,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 09:53:40,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:53:40,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672331023] [2025-01-09 09:53:40,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672331023] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:53:40,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:53:40,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 09:53:40,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099369504] [2025-01-09 09:53:40,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:53:40,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 09:53:40,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:53:40,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 09:53:40,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-01-09 09:53:40,106 INFO L87 Difference]: Start difference. First operand 819 states and 1204 transitions. Second operand has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:53:43,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:53:43,045 INFO L93 Difference]: Finished difference Result 1421 states and 2083 transitions. [2025-01-09 09:53:43,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 09:53:43,045 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-01-09 09:53:43,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:53:43,050 INFO L225 Difference]: With dead ends: 1421 [2025-01-09 09:53:43,050 INFO L226 Difference]: Without dead ends: 1011 [2025-01-09 09:53:43,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2025-01-09 09:53:43,052 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 528 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:53:43,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 901 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 09:53:43,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2025-01-09 09:53:43,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 819. [2025-01-09 09:53:43,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 674 states have (on average 1.3857566765578635) internal successors, (934), 674 states have internal predecessors, (934), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 09:53:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1204 transitions. [2025-01-09 09:53:43,095 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1204 transitions. Word has length 181 [2025-01-09 09:53:43,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:53:43,095 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1204 transitions. [2025-01-09 09:53:43,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:53:43,096 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1204 transitions. [2025-01-09 09:53:43,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 09:53:43,097 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:53:43,097 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:53:43,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 09:53:43,097 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:53:43,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:53:43,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1022856819, now seen corresponding path program 1 times [2025-01-09 09:53:43,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:53:43,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86098895] [2025-01-09 09:53:43,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:53:43,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:53:43,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 09:53:43,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 09:53:43,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:53:43,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:53:44,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 09:53:44,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:53:44,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86098895] [2025-01-09 09:53:44,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86098895] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:53:44,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:53:44,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 09:53:44,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641972601] [2025-01-09 09:53:44,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:53:44,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 09:53:44,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:53:44,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 09:53:44,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:53:44,872 INFO L87 Difference]: Start difference. First operand 819 states and 1204 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:53:46,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:53:46,171 INFO L93 Difference]: Finished difference Result 1659 states and 2425 transitions. [2025-01-09 09:53:46,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 09:53:46,172 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-01-09 09:53:46,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:53:46,180 INFO L225 Difference]: With dead ends: 1659 [2025-01-09 09:53:46,180 INFO L226 Difference]: Without dead ends: 1095 [2025-01-09 09:53:46,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2025-01-09 09:53:46,182 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 284 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:53:46,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 691 Invalid, 872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 09:53:46,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2025-01-09 09:53:46,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 867. [2025-01-09 09:53:46,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 722 states have (on average 1.373961218836565) internal successors, (992), 722 states have internal predecessors, (992), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 09:53:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1262 transitions. [2025-01-09 09:53:46,227 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1262 transitions. Word has length 181 [2025-01-09 09:53:46,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:53:46,227 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1262 transitions. [2025-01-09 09:53:46,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:53:46,227 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1262 transitions. [2025-01-09 09:53:46,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 09:53:46,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:53:46,229 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:53:46,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 09:53:46,229 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:53:46,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:53:46,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1497103115, now seen corresponding path program 1 times [2025-01-09 09:53:46,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:53:46,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216253469] [2025-01-09 09:53:46,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:53:46,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:53:46,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 09:53:46,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 09:53:46,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:53:46,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:53:58,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2025-01-09 09:53:58,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:53:58,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216253469] [2025-01-09 09:53:58,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216253469] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:53:58,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:53:58,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 09:53:58,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178667663] [2025-01-09 09:53:58,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:53:58,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 09:53:58,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:53:58,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 09:53:58,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2025-01-09 09:53:58,505 INFO L87 Difference]: Start difference. First operand 867 states and 1262 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:54:04,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:54:04,257 INFO L93 Difference]: Finished difference Result 1709 states and 2415 transitions. [2025-01-09 09:54:04,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 09:54:04,258 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 181 [2025-01-09 09:54:04,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:54:04,262 INFO L225 Difference]: With dead ends: 1709 [2025-01-09 09:54:04,263 INFO L226 Difference]: Without dead ends: 1299 [2025-01-09 09:54:04,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2025-01-09 09:54:04,265 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 387 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 1528 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:54:04,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 939 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1528 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 09:54:04,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2025-01-09 09:54:04,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 919. [2025-01-09 09:54:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 774 states have (on average 1.3669250645994833) internal successors, (1058), 774 states have internal predecessors, (1058), 135 states have call successors, (135), 9 states have call predecessors, (135), 9 states have return successors, (135), 135 states have call predecessors, (135), 135 states have call successors, (135) [2025-01-09 09:54:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1328 transitions. [2025-01-09 09:54:04,314 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1328 transitions. Word has length 181 [2025-01-09 09:54:04,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:54:04,315 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1328 transitions. [2025-01-09 09:54:04,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2025-01-09 09:54:04,315 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1328 transitions. [2025-01-09 09:54:04,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 09:54:04,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:54:04,316 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 09:54:04,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 09:54:04,317 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:54:04,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:54:04,317 INFO L85 PathProgramCache]: Analyzing trace with hash 721488709, now seen corresponding path program 1 times [2025-01-09 09:54:04,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:54:04,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998403023] [2025-01-09 09:54:04,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:54:04,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:54:04,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 09:54:04,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 09:54:04,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:54:04,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat