./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-56.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-56.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 9d9e482375fcd558b315d6d7125c6d1058f6054bc52b6693ff996c0cb6bda49c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:06:20,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:06:20,410 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:06:20,415 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:06:20,415 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:06:20,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:06:20,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:06:20,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:06:20,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:06:20,447 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:06:20,447 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:06:20,447 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:06:20,448 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:06:20,448 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:06:20,448 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:06:20,448 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:06:20,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:06:20,448 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:06:20,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:06:20,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:06:20,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:06:20,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:06:20,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:06:20,449 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:06:20,450 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:06:20,450 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:06:20,450 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:06:20,450 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:06:20,450 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:06:20,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:06:20,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:06:20,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:06:20,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:06:20,450 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:06:20,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:06:20,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:06:20,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:06:20,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:06:20,451 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:06:20,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:06:20,451 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:06:20,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:06:20,451 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:06:20,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:06:20,451 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:06:20,451 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:06:20,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:06:20,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:06:20,451 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 -> 9d9e482375fcd558b315d6d7125c6d1058f6054bc52b6693ff996c0cb6bda49c [2025-01-09 10:06:20,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:06:20,740 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:06:20,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:06:20,745 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:06:20,745 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:06:20,746 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-56.i [2025-01-09 10:06:22,080 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81bacd8ce/67acc84556a64ff98f09c775c8dedab6/FLAG6e1c7bfe4 [2025-01-09 10:06:22,455 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:06:22,456 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-56.i [2025-01-09 10:06:22,475 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81bacd8ce/67acc84556a64ff98f09c775c8dedab6/FLAG6e1c7bfe4 [2025-01-09 10:06:22,497 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81bacd8ce/67acc84556a64ff98f09c775c8dedab6 [2025-01-09 10:06:22,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:06:22,503 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:06:22,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:06:22,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:06:22,510 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:06:22,511 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:06:22" (1/1) ... [2025-01-09 10:06:22,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30780e8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:22, skipping insertion in model container [2025-01-09 10:06:22,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:06:22" (1/1) ... [2025-01-09 10:06:22,551 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:06:22,696 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-56.i[916,929] [2025-01-09 10:06:22,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:06:22,918 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:06:22,928 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-56.i[916,929] [2025-01-09 10:06:23,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:06:23,068 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:06:23,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:23 WrapperNode [2025-01-09 10:06:23,069 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:06:23,070 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:06:23,070 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:06:23,071 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:06:23,078 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:06:23" (1/1) ... [2025-01-09 10:06:23,105 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:06:23" (1/1) ... [2025-01-09 10:06:23,181 INFO L138 Inliner]: procedures = 26, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 951 [2025-01-09 10:06:23,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:06:23,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:06:23,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:06:23,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:06:23,191 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:23" (1/1) ... [2025-01-09 10:06:23,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:23" (1/1) ... [2025-01-09 10:06:23,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:23" (1/1) ... [2025-01-09 10:06:23,250 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:06:23,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:23" (1/1) ... [2025-01-09 10:06:23,252 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:23" (1/1) ... [2025-01-09 10:06:23,281 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:23" (1/1) ... [2025-01-09 10:06:23,287 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:23" (1/1) ... [2025-01-09 10:06:23,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:23" (1/1) ... [2025-01-09 10:06:23,318 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:23" (1/1) ... [2025-01-09 10:06:23,324 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:23" (1/1) ... [2025-01-09 10:06:23,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:06:23,340 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:06:23,340 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:06:23,340 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:06:23,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:23" (1/1) ... [2025-01-09 10:06:23,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:06:23,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:06:23,372 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:06:23,375 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:06:23,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:06:23,398 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:06:23,398 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:06:23,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:06:23,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:06:23,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:06:23,550 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:06:23,552 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:06:25,026 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-01-09 10:06:25,027 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:06:25,042 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:06:25,043 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:06:25,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:06:25 BoogieIcfgContainer [2025-01-09 10:06:25,044 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:06:25,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:06:25,046 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:06:25,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:06:25,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:06:22" (1/3) ... [2025-01-09 10:06:25,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c42d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:06:25, skipping insertion in model container [2025-01-09 10:06:25,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:06:23" (2/3) ... [2025-01-09 10:06:25,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c42d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:06:25, skipping insertion in model container [2025-01-09 10:06:25,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:06:25" (3/3) ... [2025-01-09 10:06:25,055 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-56.i [2025-01-09 10:06:25,069 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:06:25,072 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-56.i that has 2 procedures, 391 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:06:25,154 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:06:25,166 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;@2164fa81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:06:25,166 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:06:25,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 391 states, 259 states have (on average 1.5752895752895753) internal successors, (408), 260 states have internal predecessors, (408), 129 states have call successors, (129), 1 states have call predecessors, (129), 1 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-01-09 10:06:25,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 810 [2025-01-09 10:06:25,221 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:25,222 INFO L218 NwaCegarLoop]: trace histogram [129, 129, 129, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:25,222 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:25,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:25,230 INFO L85 PathProgramCache]: Analyzing trace with hash -103883279, now seen corresponding path program 1 times [2025-01-09 10:06:25,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:25,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515098009] [2025-01-09 10:06:25,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:25,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:25,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 809 statements into 1 equivalence classes. [2025-01-09 10:06:25,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 809 of 809 statements. [2025-01-09 10:06:25,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:25,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 33024 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 32768 trivial. 0 not checked. [2025-01-09 10:06:26,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:26,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515098009] [2025-01-09 10:06:26,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515098009] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:06:26,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442794367] [2025-01-09 10:06:26,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:26,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:06:26,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:06:26,059 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:06:26,061 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:06:26,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 809 statements into 1 equivalence classes. [2025-01-09 10:06:26,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 809 of 809 statements. [2025-01-09 10:06:26,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:26,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:26,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 1820 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:06:26,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:06:26,758 INFO L134 CoverageAnalysis]: Checked inductivity of 33024 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 32768 trivial. 0 not checked. [2025-01-09 10:06:26,759 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:06:26,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442794367] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:26,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:06:26,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:06:26,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978009196] [2025-01-09 10:06:26,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:26,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:06:26,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:26,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:06:26,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:06:26,790 INFO L87 Difference]: Start difference. First operand has 391 states, 259 states have (on average 1.5752895752895753) internal successors, (408), 260 states have internal predecessors, (408), 129 states have call successors, (129), 1 states have call predecessors, (129), 1 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) Second operand has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 2 states have call successors, (129), 2 states have call predecessors, (129), 1 states have return successors, (129), 1 states have call predecessors, (129), 2 states have call successors, (129) [2025-01-09 10:06:26,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:06:26,862 INFO L93 Difference]: Finished difference Result 776 states and 1456 transitions. [2025-01-09 10:06:26,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:06:26,866 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 2 states have call successors, (129), 2 states have call predecessors, (129), 1 states have return successors, (129), 1 states have call predecessors, (129), 2 states have call successors, (129) Word has length 809 [2025-01-09 10:06:26,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:06:26,876 INFO L225 Difference]: With dead ends: 776 [2025-01-09 10:06:26,876 INFO L226 Difference]: Without dead ends: 388 [2025-01-09 10:06:26,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 810 GetRequests, 810 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:06:26,885 INFO L435 NwaCegarLoop]: 660 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, 660 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:06:26,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:06:26,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-01-09 10:06:26,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2025-01-09 10:06:26,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 257 states have (on average 1.5642023346303502) internal successors, (402), 257 states have internal predecessors, (402), 129 states have call successors, (129), 1 states have call predecessors, (129), 1 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-01-09 10:06:26,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 660 transitions. [2025-01-09 10:06:26,988 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 660 transitions. Word has length 809 [2025-01-09 10:06:26,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:26,989 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 660 transitions. [2025-01-09 10:06:26,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 2 states have call successors, (129), 2 states have call predecessors, (129), 1 states have return successors, (129), 1 states have call predecessors, (129), 2 states have call successors, (129) [2025-01-09 10:06:26,989 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 660 transitions. [2025-01-09 10:06:27,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 810 [2025-01-09 10:06:27,016 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:27,017 INFO L218 NwaCegarLoop]: trace histogram [129, 129, 129, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:27,028 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:06:27,218 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:06:27,218 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:27,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:27,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1016663163, now seen corresponding path program 1 times [2025-01-09 10:06:27,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:27,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521950152] [2025-01-09 10:06:27,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:27,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:27,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 809 statements into 1 equivalence classes. [2025-01-09 10:06:27,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 809 of 809 statements. [2025-01-09 10:06:27,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:27,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:28,094 INFO L134 CoverageAnalysis]: Checked inductivity of 33024 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33024 trivial. 0 not checked. [2025-01-09 10:06:28,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:28,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521950152] [2025-01-09 10:06:28,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521950152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:28,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:06:28,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:06:28,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291763020] [2025-01-09 10:06:28,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:28,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:06:28,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:28,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:06:28,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:06:28,100 INFO L87 Difference]: Start difference. First operand 388 states and 660 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (129), 1 states have call predecessors, (129), 1 states have return successors, (129), 1 states have call predecessors, (129), 1 states have call successors, (129) [2025-01-09 10:06:28,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:06:28,236 INFO L93 Difference]: Finished difference Result 1004 states and 1717 transitions. [2025-01-09 10:06:28,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:06:28,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (129), 1 states have call predecessors, (129), 1 states have return successors, (129), 1 states have call predecessors, (129), 1 states have call successors, (129) Word has length 809 [2025-01-09 10:06:28,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:06:28,250 INFO L225 Difference]: With dead ends: 1004 [2025-01-09 10:06:28,251 INFO L226 Difference]: Without dead ends: 619 [2025-01-09 10:06:28,253 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:06:28,255 INFO L435 NwaCegarLoop]: 940 mSDtfsCounter, 388 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1575 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:06:28,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1575 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:06:28,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-01-09 10:06:28,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 616. [2025-01-09 10:06:28,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 446 states have (on average 1.609865470852018) internal successors, (718), 447 states have internal predecessors, (718), 167 states have call successors, (167), 2 states have call predecessors, (167), 2 states have return successors, (167), 166 states have call predecessors, (167), 167 states have call successors, (167) [2025-01-09 10:06:28,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 1052 transitions. [2025-01-09 10:06:28,331 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 1052 transitions. Word has length 809 [2025-01-09 10:06:28,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:28,333 INFO L471 AbstractCegarLoop]: Abstraction has 616 states and 1052 transitions. [2025-01-09 10:06:28,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 1 states have call successors, (129), 1 states have call predecessors, (129), 1 states have return successors, (129), 1 states have call predecessors, (129), 1 states have call successors, (129) [2025-01-09 10:06:28,335 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 1052 transitions. [2025-01-09 10:06:28,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2025-01-09 10:06:28,346 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:28,347 INFO L218 NwaCegarLoop]: trace histogram [129, 129, 129, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:28,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:06:28,347 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:28,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:28,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1467413672, now seen corresponding path program 1 times [2025-01-09 10:06:28,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:28,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298664976] [2025-01-09 10:06:28,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:28,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:28,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 810 statements into 1 equivalence classes. [2025-01-09 10:06:28,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 810 of 810 statements. [2025-01-09 10:06:28,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:28,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:29,017 INFO L134 CoverageAnalysis]: Checked inductivity of 33024 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33024 trivial. 0 not checked. [2025-01-09 10:06:29,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:29,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298664976] [2025-01-09 10:06:29,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298664976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:29,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:06:29,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:06:29,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964493757] [2025-01-09 10:06:29,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:29,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:06:29,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:29,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:06:29,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:06:29,020 INFO L87 Difference]: Start difference. First operand 616 states and 1052 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (129), 1 states have call predecessors, (129), 1 states have return successors, (129), 1 states have call predecessors, (129), 1 states have call successors, (129) [2025-01-09 10:06:29,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:06:29,345 INFO L93 Difference]: Finished difference Result 1443 states and 2461 transitions. [2025-01-09 10:06:29,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:06:29,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (129), 1 states have call predecessors, (129), 1 states have return successors, (129), 1 states have call predecessors, (129), 1 states have call successors, (129) Word has length 810 [2025-01-09 10:06:29,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:06:29,356 INFO L225 Difference]: With dead ends: 1443 [2025-01-09 10:06:29,358 INFO L226 Difference]: Without dead ends: 830 [2025-01-09 10:06:29,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:06:29,362 INFO L435 NwaCegarLoop]: 845 mSDtfsCounter, 728 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 2121 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:06:29,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 2121 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:06:29,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2025-01-09 10:06:29,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 536. [2025-01-09 10:06:29,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 404 states have (on average 1.6262376237623761) internal successors, (657), 404 states have internal predecessors, (657), 129 states have call successors, (129), 2 states have call predecessors, (129), 2 states have return successors, (129), 129 states have call predecessors, (129), 129 states have call successors, (129) [2025-01-09 10:06:29,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 915 transitions. [2025-01-09 10:06:29,406 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 915 transitions. Word has length 810 [2025-01-09 10:06:29,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:29,409 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 915 transitions. [2025-01-09 10:06:29,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (129), 1 states have call predecessors, (129), 1 states have return successors, (129), 1 states have call predecessors, (129), 1 states have call successors, (129) [2025-01-09 10:06:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 915 transitions. [2025-01-09 10:06:29,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2025-01-09 10:06:29,419 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:29,420 INFO L218 NwaCegarLoop]: trace histogram [129, 129, 129, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:29,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:06:29,420 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:29,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:29,421 INFO L85 PathProgramCache]: Analyzing trace with hash -479832684, now seen corresponding path program 1 times [2025-01-09 10:06:29,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:29,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785259468] [2025-01-09 10:06:29,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:29,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:29,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 810 statements into 1 equivalence classes. [2025-01-09 10:06:29,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 810 of 810 statements. [2025-01-09 10:06:29,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:29,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:29,974 INFO L134 CoverageAnalysis]: Checked inductivity of 33024 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33024 trivial. 0 not checked. [2025-01-09 10:06:29,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:29,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785259468] [2025-01-09 10:06:29,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785259468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:29,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:06:29,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:06:29,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302693020] [2025-01-09 10:06:29,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:29,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:06:29,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:29,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:06:29,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:06:29,979 INFO L87 Difference]: Start difference. First operand 536 states and 915 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (129), 1 states have call predecessors, (129), 1 states have return successors, (129), 2 states have call predecessors, (129), 2 states have call successors, (129) [2025-01-09 10:06:30,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:06:30,588 INFO L93 Difference]: Finished difference Result 1602 states and 2739 transitions. [2025-01-09 10:06:30,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:06:30,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (129), 1 states have call predecessors, (129), 1 states have return successors, (129), 2 states have call predecessors, (129), 2 states have call successors, (129) Word has length 810 [2025-01-09 10:06:30,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:06:30,598 INFO L225 Difference]: With dead ends: 1602 [2025-01-09 10:06:30,598 INFO L226 Difference]: Without dead ends: 1069 [2025-01-09 10:06:30,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:06:30,601 INFO L435 NwaCegarLoop]: 836 mSDtfsCounter, 699 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:06:30,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 2115 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 10:06:30,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2025-01-09 10:06:30,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1067. [2025-01-09 10:06:30,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 804 states have (on average 1.626865671641791) internal successors, (1308), 804 states have internal predecessors, (1308), 258 states have call successors, (258), 4 states have call predecessors, (258), 4 states have return successors, (258), 258 states have call predecessors, (258), 258 states have call successors, (258) [2025-01-09 10:06:30,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1824 transitions. [2025-01-09 10:06:30,709 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1824 transitions. Word has length 810 [2025-01-09 10:06:30,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:30,711 INFO L471 AbstractCegarLoop]: Abstraction has 1067 states and 1824 transitions. [2025-01-09 10:06:30,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 2 states have call successors, (129), 1 states have call predecessors, (129), 1 states have return successors, (129), 2 states have call predecessors, (129), 2 states have call successors, (129) [2025-01-09 10:06:30,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1824 transitions. [2025-01-09 10:06:30,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2025-01-09 10:06:30,722 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:30,723 INFO L218 NwaCegarLoop]: trace histogram [129, 129, 129, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:30,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:06:30,723 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:30,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:30,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2128954774, now seen corresponding path program 1 times [2025-01-09 10:06:30,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:30,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413931661] [2025-01-09 10:06:30,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:30,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:30,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 810 statements into 1 equivalence classes. [2025-01-09 10:06:30,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 810 of 810 statements. [2025-01-09 10:06:30,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:30,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:31,145 INFO L134 CoverageAnalysis]: Checked inductivity of 33024 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33024 trivial. 0 not checked. [2025-01-09 10:06:31,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:31,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413931661] [2025-01-09 10:06:31,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413931661] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:31,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:06:31,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:06:31,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447253340] [2025-01-09 10:06:31,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:31,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:06:31,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:31,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:06:31,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:06:31,148 INFO L87 Difference]: Start difference. First operand 1067 states and 1824 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (129), 1 states have call predecessors, (129), 1 states have return successors, (129), 1 states have call predecessors, (129), 1 states have call successors, (129) [2025-01-09 10:06:31,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:06:31,590 INFO L93 Difference]: Finished difference Result 4243 states and 7244 transitions. [2025-01-09 10:06:31,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:06:31,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (129), 1 states have call predecessors, (129), 1 states have return successors, (129), 1 states have call predecessors, (129), 1 states have call successors, (129) Word has length 810 [2025-01-09 10:06:31,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:06:31,611 INFO L225 Difference]: With dead ends: 4243 [2025-01-09 10:06:31,611 INFO L226 Difference]: Without dead ends: 3179 [2025-01-09 10:06:31,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:06:31,616 INFO L435 NwaCegarLoop]: 866 mSDtfsCounter, 1279 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 2418 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:06:31,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1279 Valid, 2418 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:06:31,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2025-01-09 10:06:31,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 3167. [2025-01-09 10:06:31,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3167 states, 2530 states have (on average 1.6355731225296444) internal successors, (4138), 2536 states have internal predecessors, (4138), 620 states have call successors, (620), 16 states have call predecessors, (620), 16 states have return successors, (620), 614 states have call predecessors, (620), 620 states have call successors, (620) [2025-01-09 10:06:31,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3167 states to 3167 states and 5378 transitions. [2025-01-09 10:06:31,819 INFO L78 Accepts]: Start accepts. Automaton has 3167 states and 5378 transitions. Word has length 810 [2025-01-09 10:06:31,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:31,820 INFO L471 AbstractCegarLoop]: Abstraction has 3167 states and 5378 transitions. [2025-01-09 10:06:31,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (129), 1 states have call predecessors, (129), 1 states have return successors, (129), 1 states have call predecessors, (129), 1 states have call successors, (129) [2025-01-09 10:06:31,821 INFO L276 IsEmpty]: Start isEmpty. Operand 3167 states and 5378 transitions. [2025-01-09 10:06:31,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2025-01-09 10:06:31,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:31,832 INFO L218 NwaCegarLoop]: trace histogram [129, 129, 129, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:31,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:06:31,833 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:31,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:31,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1728849946, now seen corresponding path program 1 times [2025-01-09 10:06:31,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:31,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076255856] [2025-01-09 10:06:31,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:31,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:31,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 810 statements into 1 equivalence classes. [2025-01-09 10:06:31,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 810 of 810 statements. [2025-01-09 10:06:31,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:31,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:32,195 INFO L134 CoverageAnalysis]: Checked inductivity of 33024 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33024 trivial. 0 not checked. [2025-01-09 10:06:32,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:32,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076255856] [2025-01-09 10:06:32,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076255856] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:32,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:06:32,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:06:32,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180952103] [2025-01-09 10:06:32,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:32,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:06:32,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:32,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:06:32,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:06:32,199 INFO L87 Difference]: Start difference. First operand 3167 states and 5378 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (129), 1 states have call predecessors, (129), 1 states have return successors, (129), 1 states have call predecessors, (129), 1 states have call successors, (129) [2025-01-09 10:06:32,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:06:32,431 INFO L93 Difference]: Finished difference Result 7819 states and 13140 transitions. [2025-01-09 10:06:32,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:06:32,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (129), 1 states have call predecessors, (129), 1 states have return successors, (129), 1 states have call predecessors, (129), 1 states have call successors, (129) Word has length 810 [2025-01-09 10:06:32,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:06:32,467 INFO L225 Difference]: With dead ends: 7819 [2025-01-09 10:06:32,467 INFO L226 Difference]: Without dead ends: 4655 [2025-01-09 10:06:32,479 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:06:32,479 INFO L435 NwaCegarLoop]: 970 mSDtfsCounter, 375 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:06:32,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1621 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:06:32,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4655 states. [2025-01-09 10:06:32,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4655 to 4651. [2025-01-09 10:06:32,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4651 states, 3394 states have (on average 1.5609899823217444) internal successors, (5298), 3408 states have internal predecessors, (5298), 1224 states have call successors, (1224), 32 states have call predecessors, (1224), 32 states have return successors, (1224), 1210 states have call predecessors, (1224), 1224 states have call successors, (1224) [2025-01-09 10:06:32,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4651 states to 4651 states and 7746 transitions. [2025-01-09 10:06:32,914 INFO L78 Accepts]: Start accepts. Automaton has 4651 states and 7746 transitions. Word has length 810 [2025-01-09 10:06:32,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:32,917 INFO L471 AbstractCegarLoop]: Abstraction has 4651 states and 7746 transitions. [2025-01-09 10:06:32,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (129), 1 states have call predecessors, (129), 1 states have return successors, (129), 1 states have call predecessors, (129), 1 states have call successors, (129) [2025-01-09 10:06:32,917 INFO L276 IsEmpty]: Start isEmpty. Operand 4651 states and 7746 transitions. [2025-01-09 10:06:32,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2025-01-09 10:06:32,927 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:32,928 INFO L218 NwaCegarLoop]: trace histogram [129, 129, 129, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:32,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:06:32,928 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:32,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:32,929 INFO L85 PathProgramCache]: Analyzing trace with hash 462608030, now seen corresponding path program 1 times [2025-01-09 10:06:32,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:32,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351248314] [2025-01-09 10:06:32,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:32,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:32,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 810 statements into 1 equivalence classes. [2025-01-09 10:06:33,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 810 of 810 statements. [2025-01-09 10:06:33,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:33,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:33,989 INFO L134 CoverageAnalysis]: Checked inductivity of 33024 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33024 trivial. 0 not checked. [2025-01-09 10:06:33,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:33,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351248314] [2025-01-09 10:06:33,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351248314] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:33,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:06:33,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:06:33,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062627202] [2025-01-09 10:06:33,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:33,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:06:33,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:33,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:06:33,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:06:33,993 INFO L87 Difference]: Start difference. First operand 4651 states and 7746 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (129), 1 states have call predecessors, (129), 1 states have return successors, (129), 1 states have call predecessors, (129), 1 states have call successors, (129) [2025-01-09 10:06:34,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:06:34,719 INFO L93 Difference]: Finished difference Result 11640 states and 19397 transitions. [2025-01-09 10:06:34,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:06:34,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (129), 1 states have call predecessors, (129), 1 states have return successors, (129), 1 states have call predecessors, (129), 1 states have call successors, (129) Word has length 810 [2025-01-09 10:06:34,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:06:34,768 INFO L225 Difference]: With dead ends: 11640 [2025-01-09 10:06:34,768 INFO L226 Difference]: Without dead ends: 6992 [2025-01-09 10:06:34,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:06:34,786 INFO L435 NwaCegarLoop]: 785 mSDtfsCounter, 404 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1954 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:06:34,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1954 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:06:34,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6992 states. [2025-01-09 10:06:35,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6992 to 6990. [2025-01-09 10:06:35,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6990 states, 5105 states have (on average 1.5602350636630755) internal successors, (7965), 5126 states have internal predecessors, (7965), 1836 states have call successors, (1836), 48 states have call predecessors, (1836), 48 states have return successors, (1836), 1815 states have call predecessors, (1836), 1836 states have call successors, (1836) [2025-01-09 10:06:35,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6990 states to 6990 states and 11637 transitions. [2025-01-09 10:06:35,307 INFO L78 Accepts]: Start accepts. Automaton has 6990 states and 11637 transitions. Word has length 810 [2025-01-09 10:06:35,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:35,308 INFO L471 AbstractCegarLoop]: Abstraction has 6990 states and 11637 transitions. [2025-01-09 10:06:35,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 1 states have call successors, (129), 1 states have call predecessors, (129), 1 states have return successors, (129), 1 states have call predecessors, (129), 1 states have call successors, (129) [2025-01-09 10:06:35,309 INFO L276 IsEmpty]: Start isEmpty. Operand 6990 states and 11637 transitions. [2025-01-09 10:06:35,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2025-01-09 10:06:35,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:35,320 INFO L218 NwaCegarLoop]: trace histogram [129, 129, 129, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:35,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:06:35,321 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:35,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:35,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1122139552, now seen corresponding path program 1 times [2025-01-09 10:06:35,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:35,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340823382] [2025-01-09 10:06:35,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:35,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:35,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 810 statements into 1 equivalence classes. [2025-01-09 10:06:35,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 810 of 810 statements. [2025-01-09 10:06:35,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:35,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:06:36,010 INFO L134 CoverageAnalysis]: Checked inductivity of 33024 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33024 trivial. 0 not checked. [2025-01-09 10:06:36,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:06:36,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340823382] [2025-01-09 10:06:36,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340823382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:06:36,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:06:36,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:06:36,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439023242] [2025-01-09 10:06:36,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:06:36,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:06:36,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:06:36,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:06:36,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:06:36,014 INFO L87 Difference]: Start difference. First operand 6990 states and 11637 transitions. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (129), 1 states have call predecessors, (129), 1 states have return successors, (129), 1 states have call predecessors, (129), 1 states have call successors, (129) [2025-01-09 10:06:36,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:06:36,294 INFO L93 Difference]: Finished difference Result 13983 states and 23283 transitions. [2025-01-09 10:06:36,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:06:36,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (129), 1 states have call predecessors, (129), 1 states have return successors, (129), 1 states have call predecessors, (129), 1 states have call successors, (129) Word has length 810 [2025-01-09 10:06:36,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:06:36,374 INFO L225 Difference]: With dead ends: 13983 [2025-01-09 10:06:36,374 INFO L226 Difference]: Without dead ends: 6996 [2025-01-09 10:06:36,402 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:06:36,402 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 0 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:06:36,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1312 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:06:36,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6996 states. [2025-01-09 10:06:36,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6996 to 6996. [2025-01-09 10:06:36,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6996 states, 5111 states have (on average 1.5595773821170025) internal successors, (7971), 5132 states have internal predecessors, (7971), 1836 states have call successors, (1836), 48 states have call predecessors, (1836), 48 states have return successors, (1836), 1815 states have call predecessors, (1836), 1836 states have call successors, (1836) [2025-01-09 10:06:36,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6996 states to 6996 states and 11643 transitions. [2025-01-09 10:06:37,004 INFO L78 Accepts]: Start accepts. Automaton has 6996 states and 11643 transitions. Word has length 810 [2025-01-09 10:06:37,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:06:37,005 INFO L471 AbstractCegarLoop]: Abstraction has 6996 states and 11643 transitions. [2025-01-09 10:06:37,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 1 states have call successors, (129), 1 states have call predecessors, (129), 1 states have return successors, (129), 1 states have call predecessors, (129), 1 states have call successors, (129) [2025-01-09 10:06:37,007 INFO L276 IsEmpty]: Start isEmpty. Operand 6996 states and 11643 transitions. [2025-01-09 10:06:37,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 812 [2025-01-09 10:06:37,023 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:06:37,024 INFO L218 NwaCegarLoop]: trace histogram [129, 129, 129, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:37,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:06:37,024 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:06:37,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:06:37,025 INFO L85 PathProgramCache]: Analyzing trace with hash 786331164, now seen corresponding path program 1 times [2025-01-09 10:06:37,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:06:37,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660102107] [2025-01-09 10:06:37,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:06:37,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:06:37,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 811 statements into 1 equivalence classes. [2025-01-09 10:06:37,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 811 of 811 statements. [2025-01-09 10:06:37,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:06:37,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat