./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-16.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-500_file-16.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 5156256452dc861aba62ea76c0f9e47cdd0f69dc1017e09229ee6055fbff4337 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:02:46,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:02:46,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:02:46,823 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:02:46,823 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:02:46,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:02:46,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:02:46,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:02:46,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:02:46,857 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:02:46,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:02:46,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:02:46,858 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:02:46,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:02:46,858 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:02:46,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:02:46,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:02:46,858 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:02:46,858 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:02:46,858 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:02:46,858 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:02:46,858 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:02:46,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:02:46,859 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:02:46,859 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:02:46,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:02:46,859 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:02:46,859 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:02:46,859 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:02:46,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:02:46,859 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:02:46,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:02:46,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:02:46,860 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:02:46,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:02:46,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:02:46,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:02:46,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:02:46,861 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:02:46,861 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:02:46,861 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:02:46,861 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:02:46,861 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:02:46,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:02:46,861 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:02:46,861 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:02:46,861 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:02:46,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:02:46,861 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 -> 5156256452dc861aba62ea76c0f9e47cdd0f69dc1017e09229ee6055fbff4337 [2025-01-09 10:02:47,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:02:47,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:02:47,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:02:47,159 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:02:47,159 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:02:47,161 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-500_file-16.i [2025-01-09 10:02:48,457 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/33516d638/a2e8b70759ed45deadbd68cea180b5e6/FLAGe32bab0d4 [2025-01-09 10:02:48,737 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:02:48,743 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-16.i [2025-01-09 10:02:48,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/33516d638/a2e8b70759ed45deadbd68cea180b5e6/FLAGe32bab0d4 [2025-01-09 10:02:49,023 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/33516d638/a2e8b70759ed45deadbd68cea180b5e6 [2025-01-09 10:02:49,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:02:49,028 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:02:49,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:02:49,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:02:49,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:02:49,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:02:49" (1/1) ... [2025-01-09 10:02:49,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf0269b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:49, skipping insertion in model container [2025-01-09 10:02:49,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:02:49" (1/1) ... [2025-01-09 10:02:49,058 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:02:49,175 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-500_file-16.i[916,929] [2025-01-09 10:02:49,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:02:49,295 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:02:49,305 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-500_file-16.i[916,929] [2025-01-09 10:02:49,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:02:49,387 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:02:49,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:49 WrapperNode [2025-01-09 10:02:49,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:02:49,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:02:49,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:02:49,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:02:49,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:49" (1/1) ... [2025-01-09 10:02:49,404 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:49" (1/1) ... [2025-01-09 10:02:49,485 INFO L138 Inliner]: procedures = 26, calls = 116, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 897 [2025-01-09 10:02:49,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:02:49,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:02:49,487 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:02:49,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:02:49,494 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:49" (1/1) ... [2025-01-09 10:02:49,495 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:49" (1/1) ... [2025-01-09 10:02:49,508 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:49" (1/1) ... [2025-01-09 10:02:49,546 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 10:02:49,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:49" (1/1) ... [2025-01-09 10:02:49,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:49" (1/1) ... [2025-01-09 10:02:49,575 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:49" (1/1) ... [2025-01-09 10:02:49,582 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:49" (1/1) ... [2025-01-09 10:02:49,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:49" (1/1) ... [2025-01-09 10:02:49,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:49" (1/1) ... [2025-01-09 10:02:49,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:49" (1/1) ... [2025-01-09 10:02:49,622 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:02:49,623 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:02:49,623 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:02:49,623 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:02:49,624 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:49" (1/1) ... [2025-01-09 10:02:49,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:02:49,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:02:49,653 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 10:02:49,657 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 10:02:49,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:02:49,675 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:02:49,675 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:02:49,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:02:49,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:02:49,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:02:49,798 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:02:49,799 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:02:50,951 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-01-09 10:02:50,951 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:02:50,967 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:02:50,970 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:02:50,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:02:50 BoogieIcfgContainer [2025-01-09 10:02:50,971 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:02:50,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:02:50,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:02:50,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:02:50,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:02:49" (1/3) ... [2025-01-09 10:02:50,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@480eea94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:02:50, skipping insertion in model container [2025-01-09 10:02:50,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:02:49" (2/3) ... [2025-01-09 10:02:50,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@480eea94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:02:50, skipping insertion in model container [2025-01-09 10:02:50,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:02:50" (3/3) ... [2025-01-09 10:02:50,980 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-16.i [2025-01-09 10:02:50,991 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:02:50,994 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-16.i that has 2 procedures, 365 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:02:51,056 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:02:51,067 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;@3e300909, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:02:51,068 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:02:51,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 365 states, 259 states have (on average 1.5945945945945945) internal successors, (413), 260 states have internal predecessors, (413), 103 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2025-01-09 10:02:51,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2025-01-09 10:02:51,107 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:51,108 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:51,108 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:51,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:51,113 INFO L85 PathProgramCache]: Analyzing trace with hash -2027868187, now seen corresponding path program 1 times [2025-01-09 10:02:51,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:51,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662142582] [2025-01-09 10:02:51,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:51,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:51,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-01-09 10:02:51,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-01-09 10:02:51,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:51,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:51,662 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 20808 trivial. 0 not checked. [2025-01-09 10:02:51,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:51,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662142582] [2025-01-09 10:02:51,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662142582] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:02:51,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560113219] [2025-01-09 10:02:51,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:51,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:02:51,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:02:51,666 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 10:02:51,670 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 10:02:51,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-01-09 10:02:52,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-01-09 10:02:52,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:52,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:52,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 1543 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:02:52,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:02:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 20808 trivial. 0 not checked. [2025-01-09 10:02:52,123 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:02:52,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560113219] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:52,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:02:52,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:02:52,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390807986] [2025-01-09 10:02:52,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:52,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:02:52,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:52,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:02:52,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:02:52,154 INFO L87 Difference]: Start difference. First operand has 365 states, 259 states have (on average 1.5945945945945945) internal successors, (413), 260 states have internal predecessors, (413), 103 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) Second operand has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (103), 2 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 2 states have call successors, (103) [2025-01-09 10:02:52,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:52,222 INFO L93 Difference]: Finished difference Result 724 states and 1336 transitions. [2025-01-09 10:02:52,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:02:52,225 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (103), 2 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 2 states have call successors, (103) Word has length 667 [2025-01-09 10:02:52,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:52,235 INFO L225 Difference]: With dead ends: 724 [2025-01-09 10:02:52,236 INFO L226 Difference]: Without dead ends: 362 [2025-01-09 10:02:52,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 668 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 10:02:52,245 INFO L435 NwaCegarLoop]: 611 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, 611 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 10:02:52,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:02:52,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-01-09 10:02:52,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2025-01-09 10:02:52,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 257 states have (on average 1.575875486381323) internal successors, (405), 257 states have internal predecessors, (405), 103 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 103 states have call predecessors, (103), 103 states have call successors, (103) [2025-01-09 10:02:52,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 611 transitions. [2025-01-09 10:02:52,342 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 611 transitions. Word has length 667 [2025-01-09 10:02:52,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:52,344 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 611 transitions. [2025-01-09 10:02:52,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 78.5) internal successors, (157), 2 states have internal predecessors, (157), 2 states have call successors, (103), 2 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 2 states have call successors, (103) [2025-01-09 10:02:52,344 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 611 transitions. [2025-01-09 10:02:52,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2025-01-09 10:02:52,360 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:52,360 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:52,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 10:02:52,565 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 10:02:52,565 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:52,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:52,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1250427447, now seen corresponding path program 1 times [2025-01-09 10:02:52,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:52,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676752496] [2025-01-09 10:02:52,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:52,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:52,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-01-09 10:02:52,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-01-09 10:02:52,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:52,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:53,290 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:02:53,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:53,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676752496] [2025-01-09 10:02:53,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676752496] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:53,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:53,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:02:53,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192073530] [2025-01-09 10:02:53,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:53,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:02:53,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:53,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:02:53,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:02:53,297 INFO L87 Difference]: Start difference. First operand 362 states and 611 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:02:53,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:53,408 INFO L93 Difference]: Finished difference Result 959 states and 1614 transitions. [2025-01-09 10:02:53,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:02:53,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 667 [2025-01-09 10:02:53,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:53,419 INFO L225 Difference]: With dead ends: 959 [2025-01-09 10:02:53,419 INFO L226 Difference]: Without dead ends: 600 [2025-01-09 10:02:53,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:02:53,422 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 389 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:53,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1366 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:02:53,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-01-09 10:02:53,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 597. [2025-01-09 10:02:53,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 425 states have (on average 1.5576470588235294) internal successors, (662), 426 states have internal predecessors, (662), 169 states have call successors, (169), 2 states have call predecessors, (169), 2 states have return successors, (169), 168 states have call predecessors, (169), 169 states have call successors, (169) [2025-01-09 10:02:53,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1000 transitions. [2025-01-09 10:02:53,507 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1000 transitions. Word has length 667 [2025-01-09 10:02:53,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:53,509 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 1000 transitions. [2025-01-09 10:02:53,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:02:53,510 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1000 transitions. [2025-01-09 10:02:53,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2025-01-09 10:02:53,524 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:53,525 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:53,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:02:53,527 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:53,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:53,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1082965191, now seen corresponding path program 1 times [2025-01-09 10:02:53,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:53,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279893080] [2025-01-09 10:02:53,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:53,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:53,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-01-09 10:02:53,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-01-09 10:02:53,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:53,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:53,876 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:02:53,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:53,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279893080] [2025-01-09 10:02:53,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279893080] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:53,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:53,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:02:53,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001902242] [2025-01-09 10:02:53,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:53,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:02:53,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:53,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:02:53,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:02:53,880 INFO L87 Difference]: Start difference. First operand 597 states and 1000 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:02:53,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:53,995 INFO L93 Difference]: Finished difference Result 1659 states and 2777 transitions. [2025-01-09 10:02:53,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:02:53,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 667 [2025-01-09 10:02:53,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:54,008 INFO L225 Difference]: With dead ends: 1659 [2025-01-09 10:02:54,008 INFO L226 Difference]: Without dead ends: 1065 [2025-01-09 10:02:54,010 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 10:02:54,012 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 402 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:54,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1340 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:02:54,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2025-01-09 10:02:54,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1061. [2025-01-09 10:02:54,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 775 states have (on average 1.56) internal successors, (1209), 778 states have internal predecessors, (1209), 281 states have call successors, (281), 4 states have call predecessors, (281), 4 states have return successors, (281), 278 states have call predecessors, (281), 281 states have call successors, (281) [2025-01-09 10:02:54,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1771 transitions. [2025-01-09 10:02:54,127 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1771 transitions. Word has length 667 [2025-01-09 10:02:54,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:54,129 INFO L471 AbstractCegarLoop]: Abstraction has 1061 states and 1771 transitions. [2025-01-09 10:02:54,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:02:54,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1771 transitions. [2025-01-09 10:02:54,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2025-01-09 10:02:54,138 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:54,139 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:54,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:02:54,139 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:54,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:54,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1279730751, now seen corresponding path program 1 times [2025-01-09 10:02:54,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:54,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921460429] [2025-01-09 10:02:54,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:54,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:54,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-01-09 10:02:54,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-01-09 10:02:54,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:54,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:54,429 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:02:54,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:54,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921460429] [2025-01-09 10:02:54,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921460429] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:54,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:54,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:02:54,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524516956] [2025-01-09 10:02:54,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:54,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:02:54,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:54,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:02:54,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:02:54,433 INFO L87 Difference]: Start difference. First operand 1061 states and 1771 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:02:54,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:54,526 INFO L93 Difference]: Finished difference Result 3173 states and 5299 transitions. [2025-01-09 10:02:54,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:02:54,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 669 [2025-01-09 10:02:54,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:54,538 INFO L225 Difference]: With dead ends: 3173 [2025-01-09 10:02:54,539 INFO L226 Difference]: Without dead ends: 2115 [2025-01-09 10:02:54,543 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 10:02:54,543 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 571 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:54,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 1234 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:02:54,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2115 states. [2025-01-09 10:02:54,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2115 to 2113. [2025-01-09 10:02:54,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2113 states, 1542 states have (on average 1.5518806744487679) internal successors, (2393), 1548 states have internal predecessors, (2393), 562 states have call successors, (562), 8 states have call predecessors, (562), 8 states have return successors, (562), 556 states have call predecessors, (562), 562 states have call successors, (562) [2025-01-09 10:02:54,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 3517 transitions. [2025-01-09 10:02:54,710 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 3517 transitions. Word has length 669 [2025-01-09 10:02:54,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:54,711 INFO L471 AbstractCegarLoop]: Abstraction has 2113 states and 3517 transitions. [2025-01-09 10:02:54,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:02:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 3517 transitions. [2025-01-09 10:02:54,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2025-01-09 10:02:54,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:54,717 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:54,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:02:54,717 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:54,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:54,718 INFO L85 PathProgramCache]: Analyzing trace with hash -392507905, now seen corresponding path program 1 times [2025-01-09 10:02:54,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:54,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375266171] [2025-01-09 10:02:54,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:54,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:54,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 669 statements into 1 equivalence classes. [2025-01-09 10:02:54,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 669 of 669 statements. [2025-01-09 10:02:54,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:54,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:55,017 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:02:55,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:55,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375266171] [2025-01-09 10:02:55,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375266171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:55,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:55,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:02:55,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912016553] [2025-01-09 10:02:55,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:55,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:02:55,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:55,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:02:55,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:02:55,019 INFO L87 Difference]: Start difference. First operand 2113 states and 3517 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:02:55,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:55,217 INFO L93 Difference]: Finished difference Result 5540 states and 9218 transitions. [2025-01-09 10:02:55,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:02:55,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 669 [2025-01-09 10:02:55,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:55,234 INFO L225 Difference]: With dead ends: 5540 [2025-01-09 10:02:55,235 INFO L226 Difference]: Without dead ends: 3430 [2025-01-09 10:02:55,240 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 10:02:55,240 INFO L435 NwaCegarLoop]: 688 mSDtfsCounter, 363 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:55,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1285 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:02:55,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3430 states. [2025-01-09 10:02:55,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3430 to 3428. [2025-01-09 10:02:55,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3428 states, 2467 states have (on average 1.543169841913255) internal successors, (3807), 2476 states have internal predecessors, (3807), 946 states have call successors, (946), 14 states have call predecessors, (946), 14 states have return successors, (946), 937 states have call predecessors, (946), 946 states have call successors, (946) [2025-01-09 10:02:55,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3428 states to 3428 states and 5699 transitions. [2025-01-09 10:02:55,563 INFO L78 Accepts]: Start accepts. Automaton has 3428 states and 5699 transitions. Word has length 669 [2025-01-09 10:02:55,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:55,564 INFO L471 AbstractCegarLoop]: Abstraction has 3428 states and 5699 transitions. [2025-01-09 10:02:55,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:02:55,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3428 states and 5699 transitions. [2025-01-09 10:02:55,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2025-01-09 10:02:55,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:55,570 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:55,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:02:55,572 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:55,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:55,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1758803303, now seen corresponding path program 1 times [2025-01-09 10:02:55,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:55,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059506206] [2025-01-09 10:02:55,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:55,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:55,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 671 statements into 1 equivalence classes. [2025-01-09 10:02:55,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 671 of 671 statements. [2025-01-09 10:02:55,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:55,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:55,800 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:02:55,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:55,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059506206] [2025-01-09 10:02:55,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059506206] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:55,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:55,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:02:55,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685041369] [2025-01-09 10:02:55,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:55,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:02:55,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:55,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:02:55,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:02:55,805 INFO L87 Difference]: Start difference. First operand 3428 states and 5699 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:02:55,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:55,972 INFO L93 Difference]: Finished difference Result 6763 states and 11235 transitions. [2025-01-09 10:02:55,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:02:55,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 671 [2025-01-09 10:02:55,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:55,996 INFO L225 Difference]: With dead ends: 6763 [2025-01-09 10:02:55,996 INFO L226 Difference]: Without dead ends: 3445 [2025-01-09 10:02:56,007 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 10:02:56,008 INFO L435 NwaCegarLoop]: 809 mSDtfsCounter, 407 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:56,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1366 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:02:56,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3445 states. [2025-01-09 10:02:56,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3445 to 2603. [2025-01-09 10:02:56,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2603 states, 1954 states have (on average 1.5649948822927329) internal successors, (3058), 1958 states have internal predecessors, (3058), 636 states have call successors, (636), 12 states have call predecessors, (636), 12 states have return successors, (636), 632 states have call predecessors, (636), 636 states have call successors, (636) [2025-01-09 10:02:56,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2603 states to 2603 states and 4330 transitions. [2025-01-09 10:02:56,218 INFO L78 Accepts]: Start accepts. Automaton has 2603 states and 4330 transitions. Word has length 671 [2025-01-09 10:02:56,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:56,219 INFO L471 AbstractCegarLoop]: Abstraction has 2603 states and 4330 transitions. [2025-01-09 10:02:56,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:02:56,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2603 states and 4330 transitions. [2025-01-09 10:02:56,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2025-01-09 10:02:56,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:56,225 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:56,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:02:56,226 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:56,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:56,226 INFO L85 PathProgramCache]: Analyzing trace with hash 309098667, now seen corresponding path program 1 times [2025-01-09 10:02:56,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:56,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712228492] [2025-01-09 10:02:56,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:56,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:56,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 672 statements into 1 equivalence classes. [2025-01-09 10:02:56,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 672 of 672 statements. [2025-01-09 10:02:56,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:56,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:56,415 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:02:56,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:56,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712228492] [2025-01-09 10:02:56,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712228492] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:56,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:56,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:02:56,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059892191] [2025-01-09 10:02:56,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:56,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:02:56,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:56,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:02:56,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:02:56,417 INFO L87 Difference]: Start difference. First operand 2603 states and 4330 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:02:56,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:56,595 INFO L93 Difference]: Finished difference Result 5207 states and 8662 transitions. [2025-01-09 10:02:56,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:02:56,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 672 [2025-01-09 10:02:56,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:56,610 INFO L225 Difference]: With dead ends: 5207 [2025-01-09 10:02:56,611 INFO L226 Difference]: Without dead ends: 2607 [2025-01-09 10:02:56,617 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 10:02:56,618 INFO L435 NwaCegarLoop]: 1095 mSDtfsCounter, 560 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:56,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 1695 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:02:56,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2607 states. [2025-01-09 10:02:56,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2607 to 2605. [2025-01-09 10:02:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2605 states, 1956 states have (on average 1.5572597137014315) internal successors, (3046), 1960 states have internal predecessors, (3046), 636 states have call successors, (636), 12 states have call predecessors, (636), 12 states have return successors, (636), 632 states have call predecessors, (636), 636 states have call successors, (636) [2025-01-09 10:02:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2605 states to 2605 states and 4318 transitions. [2025-01-09 10:02:56,751 INFO L78 Accepts]: Start accepts. Automaton has 2605 states and 4318 transitions. Word has length 672 [2025-01-09 10:02:56,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:56,751 INFO L471 AbstractCegarLoop]: Abstraction has 2605 states and 4318 transitions. [2025-01-09 10:02:56,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:02:56,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2605 states and 4318 transitions. [2025-01-09 10:02:56,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2025-01-09 10:02:56,756 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:56,757 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:56,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:02:56,757 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:56,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:56,757 INFO L85 PathProgramCache]: Analyzing trace with hash 459157099, now seen corresponding path program 1 times [2025-01-09 10:02:56,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:56,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122699576] [2025-01-09 10:02:56,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:56,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:56,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 672 statements into 1 equivalence classes. [2025-01-09 10:02:56,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 672 of 672 statements. [2025-01-09 10:02:56,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:56,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:56,987 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:02:56,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:56,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122699576] [2025-01-09 10:02:56,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122699576] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:56,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:56,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:02:56,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94452878] [2025-01-09 10:02:56,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:56,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:02:56,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:56,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:02:56,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:02:56,990 INFO L87 Difference]: Start difference. First operand 2605 states and 4318 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:02:57,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:57,204 INFO L93 Difference]: Finished difference Result 6627 states and 10898 transitions. [2025-01-09 10:02:57,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:02:57,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 672 [2025-01-09 10:02:57,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:57,227 INFO L225 Difference]: With dead ends: 6627 [2025-01-09 10:02:57,228 INFO L226 Difference]: Without dead ends: 4025 [2025-01-09 10:02:57,237 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 10:02:57,238 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 278 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:57,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 1390 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:02:57,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4025 states. [2025-01-09 10:02:57,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4025 to 4015. [2025-01-09 10:02:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4015 states, 2926 states have (on average 1.5099111414900888) internal successors, (4418), 2938 states have internal predecessors, (4418), 1068 states have call successors, (1068), 20 states have call predecessors, (1068), 20 states have return successors, (1068), 1056 states have call predecessors, (1068), 1068 states have call successors, (1068) [2025-01-09 10:02:57,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4015 states to 4015 states and 6554 transitions. [2025-01-09 10:02:57,554 INFO L78 Accepts]: Start accepts. Automaton has 4015 states and 6554 transitions. Word has length 672 [2025-01-09 10:02:57,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:57,557 INFO L471 AbstractCegarLoop]: Abstraction has 4015 states and 6554 transitions. [2025-01-09 10:02:57,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:02:57,558 INFO L276 IsEmpty]: Start isEmpty. Operand 4015 states and 6554 transitions. [2025-01-09 10:02:57,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2025-01-09 10:02:57,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:57,564 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:57,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:02:57,564 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:57,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:57,565 INFO L85 PathProgramCache]: Analyzing trace with hash 481789353, now seen corresponding path program 1 times [2025-01-09 10:02:57,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:57,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632091850] [2025-01-09 10:02:57,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:57,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:57,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 672 statements into 1 equivalence classes. [2025-01-09 10:02:57,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 672 of 672 statements. [2025-01-09 10:02:57,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:57,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:57,981 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:02:57,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:57,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632091850] [2025-01-09 10:02:57,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632091850] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:57,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:57,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:02:57,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85321102] [2025-01-09 10:02:57,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:57,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:02:57,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:57,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:02:57,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:02:57,983 INFO L87 Difference]: Start difference. First operand 4015 states and 6554 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:02:59,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:59,311 INFO L93 Difference]: Finished difference Result 16941 states and 27738 transitions. [2025-01-09 10:02:59,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:02:59,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 672 [2025-01-09 10:02:59,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:59,376 INFO L225 Difference]: With dead ends: 16941 [2025-01-09 10:02:59,377 INFO L226 Difference]: Without dead ends: 12929 [2025-01-09 10:02:59,393 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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 10:02:59,394 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 1175 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 1936 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:59,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 1936 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 10:02:59,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12929 states. [2025-01-09 10:03:00,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12929 to 12875. [2025-01-09 10:03:00,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12875 states, 10138 states have (on average 1.5561254685342276) internal successors, (15776), 10198 states have internal predecessors, (15776), 2668 states have call successors, (2668), 68 states have call predecessors, (2668), 68 states have return successors, (2668), 2608 states have call predecessors, (2668), 2668 states have call successors, (2668) [2025-01-09 10:03:00,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12875 states to 12875 states and 21112 transitions. [2025-01-09 10:03:00,208 INFO L78 Accepts]: Start accepts. Automaton has 12875 states and 21112 transitions. Word has length 672 [2025-01-09 10:03:00,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:00,209 INFO L471 AbstractCegarLoop]: Abstraction has 12875 states and 21112 transitions. [2025-01-09 10:03:00,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:03:00,209 INFO L276 IsEmpty]: Start isEmpty. Operand 12875 states and 21112 transitions. [2025-01-09 10:03:00,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2025-01-09 10:03:00,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:00,226 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:00,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:03:00,227 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:00,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:00,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1397341593, now seen corresponding path program 1 times [2025-01-09 10:03:00,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:00,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043451690] [2025-01-09 10:03:00,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:00,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:00,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 672 statements into 1 equivalence classes. [2025-01-09 10:03:00,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 672 of 672 statements. [2025-01-09 10:03:00,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:00,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:00,633 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:03:00,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:00,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043451690] [2025-01-09 10:03:00,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043451690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:00,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:00,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:03:00,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151238036] [2025-01-09 10:03:00,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:00,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:03:00,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:00,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:03:00,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:03:00,635 INFO L87 Difference]: Start difference. First operand 12875 states and 21112 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:03:01,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:01,543 INFO L93 Difference]: Finished difference Result 38619 states and 63330 transitions. [2025-01-09 10:03:01,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:03:01,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 672 [2025-01-09 10:03:01,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:01,643 INFO L225 Difference]: With dead ends: 38619 [2025-01-09 10:03:01,643 INFO L226 Difference]: Without dead ends: 25747 [2025-01-09 10:03:01,681 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 10:03:01,682 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 384 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 1214 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:01,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 1214 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:03:01,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25747 states. [2025-01-09 10:03:03,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25747 to 25649. [2025-01-09 10:03:03,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25649 states, 20176 states have (on average 1.5509516256938938) internal successors, (31292), 20296 states have internal predecessors, (31292), 5336 states have call successors, (5336), 136 states have call predecessors, (5336), 136 states have return successors, (5336), 5216 states have call predecessors, (5336), 5336 states have call successors, (5336) [2025-01-09 10:03:03,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25649 states to 25649 states and 41964 transitions. [2025-01-09 10:03:03,178 INFO L78 Accepts]: Start accepts. Automaton has 25649 states and 41964 transitions. Word has length 672 [2025-01-09 10:03:03,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:03,180 INFO L471 AbstractCegarLoop]: Abstraction has 25649 states and 41964 transitions. [2025-01-09 10:03:03,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:03:03,180 INFO L276 IsEmpty]: Start isEmpty. Operand 25649 states and 41964 transitions. [2025-01-09 10:03:03,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2025-01-09 10:03:03,205 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:03,205 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:03,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:03:03,205 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:03,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:03,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1002974807, now seen corresponding path program 1 times [2025-01-09 10:03:03,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:03,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277126745] [2025-01-09 10:03:03,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:03,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:03,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 672 statements into 1 equivalence classes. [2025-01-09 10:03:03,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 672 of 672 statements. [2025-01-09 10:03:03,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:03,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:03,727 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:03:03,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:03,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277126745] [2025-01-09 10:03:03,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277126745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:03,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:03,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:03:03,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432109361] [2025-01-09 10:03:03,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:03,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:03:03,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:03,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:03:03,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:03:03,730 INFO L87 Difference]: Start difference. First operand 25649 states and 41964 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:03:05,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:05,302 INFO L93 Difference]: Finished difference Result 64357 states and 102744 transitions. [2025-01-09 10:03:05,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:03:05,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 672 [2025-01-09 10:03:05,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:05,440 INFO L225 Difference]: With dead ends: 64357 [2025-01-09 10:03:05,440 INFO L226 Difference]: Without dead ends: 38711 [2025-01-09 10:03:05,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:03:05,507 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 185 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 2416 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:05,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 2416 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:03:05,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38711 states. [2025-01-09 10:03:06,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38711 to 32305. [2025-01-09 10:03:06,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32305 states, 26448 states have (on average 1.541288566243194) internal successors, (40764), 26696 states have internal predecessors, (40764), 5592 states have call successors, (5592), 264 states have call predecessors, (5592), 264 states have return successors, (5592), 5344 states have call predecessors, (5592), 5592 states have call successors, (5592) [2025-01-09 10:03:07,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32305 states to 32305 states and 51948 transitions. [2025-01-09 10:03:07,203 INFO L78 Accepts]: Start accepts. Automaton has 32305 states and 51948 transitions. Word has length 672 [2025-01-09 10:03:07,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:07,204 INFO L471 AbstractCegarLoop]: Abstraction has 32305 states and 51948 transitions. [2025-01-09 10:03:07,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:03:07,204 INFO L276 IsEmpty]: Start isEmpty. Operand 32305 states and 51948 transitions. [2025-01-09 10:03:07,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2025-01-09 10:03:07,284 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:07,285 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:07,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:03:07,289 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:07,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:07,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1703644587, now seen corresponding path program 1 times [2025-01-09 10:03:07,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:07,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065466199] [2025-01-09 10:03:07,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:07,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:07,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 672 statements into 1 equivalence classes. [2025-01-09 10:03:07,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 672 of 672 statements. [2025-01-09 10:03:07,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:07,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:07,914 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:03:07,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:07,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065466199] [2025-01-09 10:03:07,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065466199] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:07,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:07,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:03:07,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060160643] [2025-01-09 10:03:07,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:07,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:03:07,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:07,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:03:07,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:03:07,917 INFO L87 Difference]: Start difference. First operand 32305 states and 51948 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:03:11,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:11,528 INFO L93 Difference]: Finished difference Result 99321 states and 159389 transitions. [2025-01-09 10:03:11,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 10:03:11,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 672 [2025-01-09 10:03:11,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:11,745 INFO L225 Difference]: With dead ends: 99321 [2025-01-09 10:03:11,745 INFO L226 Difference]: Without dead ends: 67019 [2025-01-09 10:03:11,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:03:11,820 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 2245 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2245 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:11,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2245 Valid, 2212 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 10:03:11,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67019 states. [2025-01-09 10:03:13,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67019 to 46409. [2025-01-09 10:03:14,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46409 states, 38504 states have (on average 1.5462289632246) internal successors, (59536), 38880 states have internal predecessors, (59536), 7512 states have call successors, (7512), 392 states have call predecessors, (7512), 392 states have return successors, (7512), 7136 states have call predecessors, (7512), 7512 states have call successors, (7512) [2025-01-09 10:03:14,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46409 states to 46409 states and 74560 transitions. [2025-01-09 10:03:14,181 INFO L78 Accepts]: Start accepts. Automaton has 46409 states and 74560 transitions. Word has length 672 [2025-01-09 10:03:14,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:14,182 INFO L471 AbstractCegarLoop]: Abstraction has 46409 states and 74560 transitions. [2025-01-09 10:03:14,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:03:14,182 INFO L276 IsEmpty]: Start isEmpty. Operand 46409 states and 74560 transitions. [2025-01-09 10:03:14,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2025-01-09 10:03:14,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:14,214 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:14,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:03:14,214 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:14,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:14,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1807036342, now seen corresponding path program 1 times [2025-01-09 10:03:14,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:14,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349880406] [2025-01-09 10:03:14,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:14,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:14,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 672 statements into 1 equivalence classes. [2025-01-09 10:03:14,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 672 of 672 statements. [2025-01-09 10:03:14,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:14,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:14,676 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:03:14,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:14,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349880406] [2025-01-09 10:03:14,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349880406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:14,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:14,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:03:14,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20140804] [2025-01-09 10:03:14,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:14,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:03:14,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:14,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:03:14,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:03:14,680 INFO L87 Difference]: Start difference. First operand 46409 states and 74560 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:03:21,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:03:21,530 INFO L93 Difference]: Finished difference Result 155985 states and 249732 transitions. [2025-01-09 10:03:21,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:03:21,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) Word has length 672 [2025-01-09 10:03:21,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:03:21,843 INFO L225 Difference]: With dead ends: 155985 [2025-01-09 10:03:21,843 INFO L226 Difference]: Without dead ends: 109579 [2025-01-09 10:03:21,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:03:21,955 INFO L435 NwaCegarLoop]: 1071 mSDtfsCounter, 1010 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 2792 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 10:03:21,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 2792 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 10:03:22,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109579 states. [2025-01-09 10:03:25,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109579 to 52581. [2025-01-09 10:03:25,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52581 states, 44676 states have (on average 1.5726564598442117) internal successors, (70260), 45052 states have internal predecessors, (70260), 7512 states have call successors, (7512), 392 states have call predecessors, (7512), 392 states have return successors, (7512), 7136 states have call predecessors, (7512), 7512 states have call successors, (7512) [2025-01-09 10:03:25,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52581 states to 52581 states and 85284 transitions. [2025-01-09 10:03:25,359 INFO L78 Accepts]: Start accepts. Automaton has 52581 states and 85284 transitions. Word has length 672 [2025-01-09 10:03:25,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:03:25,362 INFO L471 AbstractCegarLoop]: Abstraction has 52581 states and 85284 transitions. [2025-01-09 10:03:25,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 5 states have internal predecessors, (160), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103) [2025-01-09 10:03:25,362 INFO L276 IsEmpty]: Start isEmpty. Operand 52581 states and 85284 transitions. [2025-01-09 10:03:25,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2025-01-09 10:03:25,396 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:03:25,396 INFO L218 NwaCegarLoop]: trace histogram [103, 103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:03:25,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 10:03:25,397 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:03:25,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:03:25,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1730135544, now seen corresponding path program 1 times [2025-01-09 10:03:25,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:03:25,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986190029] [2025-01-09 10:03:25,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:03:25,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:03:25,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 672 statements into 1 equivalence classes. [2025-01-09 10:03:25,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 672 of 672 statements. [2025-01-09 10:03:25,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:03:25,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:03:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 21012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21012 trivial. 0 not checked. [2025-01-09 10:03:25,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:03:25,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986190029] [2025-01-09 10:03:25,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986190029] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:03:25,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:03:25,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:03:25,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186916097] [2025-01-09 10:03:25,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:03:25,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:03:25,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:03:25,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:03:25,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:03:25,617 INFO L87 Difference]: Start difference. First operand 52581 states and 85284 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (103), 1 states have call predecessors, (103), 1 states have return successors, (103), 1 states have call predecessors, (103), 1 states have call successors, (103)