./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-79.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-100_file-79.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 68466dc8851e15d5c55e16cb6abd8cdccbbd4db381e8ec074cd8097ac9916cb7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:23:58,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:23:58,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:23:58,672 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:23:58,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:23:58,689 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:23:58,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:23:58,690 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:23:58,691 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:23:58,691 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:23:58,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:23:58,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:23:58,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:23:58,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:23:58,693 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:23:58,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:23:58,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:23:58,693 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:23:58,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:23:58,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:23:58,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:23:58,693 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:23:58,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:23:58,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:23:58,694 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:23:58,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:23:58,694 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:23:58,694 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:23:58,694 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:23:58,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:23:58,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:23:58,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:23:58,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:23:58,695 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:23:58,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:23:58,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:23:58,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:23:58,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:23:58,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:23:58,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:23:58,695 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:23:58,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:23:58,695 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:23:58,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:23:58,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:23:58,695 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:23:58,695 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:23:58,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:23:58,695 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 -> 68466dc8851e15d5c55e16cb6abd8cdccbbd4db381e8ec074cd8097ac9916cb7 [2025-01-09 09:23:58,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:23:58,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:23:58,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:23:58,931 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:23:58,932 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:23:58,933 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-100_file-79.i [2025-01-09 09:24:00,070 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa788bf42/1f7d1861d75c4c2da5364578a367f4d4/FLAG6ce45989c [2025-01-09 09:24:00,310 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:24:00,310 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-79.i [2025-01-09 09:24:00,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa788bf42/1f7d1861d75c4c2da5364578a367f4d4/FLAG6ce45989c [2025-01-09 09:24:00,631 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fa788bf42/1f7d1861d75c4c2da5364578a367f4d4 [2025-01-09 09:24:00,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:24:00,634 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:24:00,635 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:24:00,635 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:24:00,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:24:00,638 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:24:00" (1/1) ... [2025-01-09 09:24:00,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3317cdfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:00, skipping insertion in model container [2025-01-09 09:24:00,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:24:00" (1/1) ... [2025-01-09 09:24:00,653 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:24:00,750 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-100_file-79.i[916,929] [2025-01-09 09:24:00,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:24:00,856 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:24:00,863 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-100_file-79.i[916,929] [2025-01-09 09:24:00,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:24:00,921 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:24:00,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:00 WrapperNode [2025-01-09 09:24:00,924 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:24:00,924 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:24:00,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:24:00,925 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:24:00,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:00" (1/1) ... [2025-01-09 09:24:00,938 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:00" (1/1) ... [2025-01-09 09:24:00,974 INFO L138 Inliner]: procedures = 26, calls = 86, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 418 [2025-01-09 09:24:00,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:24:00,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:24:00,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:24:00,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:24:00,982 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:00" (1/1) ... [2025-01-09 09:24:00,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:00" (1/1) ... [2025-01-09 09:24:00,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:00" (1/1) ... [2025-01-09 09:24:01,009 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 09:24:01,014 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:00" (1/1) ... [2025-01-09 09:24:01,014 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:00" (1/1) ... [2025-01-09 09:24:01,030 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:00" (1/1) ... [2025-01-09 09:24:01,032 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:00" (1/1) ... [2025-01-09 09:24:01,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:00" (1/1) ... [2025-01-09 09:24:01,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:00" (1/1) ... [2025-01-09 09:24:01,046 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:00" (1/1) ... [2025-01-09 09:24:01,050 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:24:01,051 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:24:01,051 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:24:01,051 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:24:01,054 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:00" (1/1) ... [2025-01-09 09:24:01,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:24:01,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:24:01,081 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 09:24:01,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 09:24:01,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:24:01,101 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:24:01,101 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:24:01,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:24:01,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:24:01,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:24:01,174 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:24:01,175 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:24:01,655 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 09:24:01,655 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:24:01,665 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:24:01,667 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:24:01,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:24:01 BoogieIcfgContainer [2025-01-09 09:24:01,668 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:24:01,670 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:24:01,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:24:01,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:24:01,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:24:00" (1/3) ... [2025-01-09 09:24:01,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f1cb8b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:24:01, skipping insertion in model container [2025-01-09 09:24:01,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:00" (2/3) ... [2025-01-09 09:24:01,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f1cb8b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:24:01, skipping insertion in model container [2025-01-09 09:24:01,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:24:01" (3/3) ... [2025-01-09 09:24:01,677 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-79.i [2025-01-09 09:24:01,688 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:24:01,689 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-79.i that has 2 procedures, 176 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:24:01,738 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:24:01,746 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;@4c7f5c15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:24:01,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:24:01,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 176 states, 100 states have (on average 1.38) internal successors, (138), 101 states have internal predecessors, (138), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-01-09 09:24:01,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-01-09 09:24:01,768 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:24:01,769 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:24:01,769 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:24:01,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:24:01,773 INFO L85 PathProgramCache]: Analyzing trace with hash 528516984, now seen corresponding path program 1 times [2025-01-09 09:24:01,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:24:01,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761196228] [2025-01-09 09:24:01,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:24:01,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:24:01,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-01-09 09:24:01,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-01-09 09:24:01,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:24:01,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:24:02,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2025-01-09 09:24:02,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:24:02,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761196228] [2025-01-09 09:24:02,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761196228] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:24:02,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101199966] [2025-01-09 09:24:02,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:24:02,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:24:02,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:24:02,154 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:24:02,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 09:24:02,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-01-09 09:24:02,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-01-09 09:24:02,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:24:02,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:24:02,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:24:02,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:24:02,497 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 10368 trivial. 0 not checked. [2025-01-09 09:24:02,497 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:24:02,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101199966] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:24:02,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:24:02,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:24:02,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410690624] [2025-01-09 09:24:02,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:24:02,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:24:02,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:24:02,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:24:02,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:24:02,519 INFO L87 Difference]: Start difference. First operand has 176 states, 100 states have (on average 1.38) internal successors, (138), 101 states have internal predecessors, (138), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) [2025-01-09 09:24:02,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:24:02,558 INFO L93 Difference]: Finished difference Result 346 states and 636 transitions. [2025-01-09 09:24:02,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:24:02,560 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) Word has length 441 [2025-01-09 09:24:02,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:24:02,565 INFO L225 Difference]: With dead ends: 346 [2025-01-09 09:24:02,565 INFO L226 Difference]: Without dead ends: 173 [2025-01-09 09:24:02,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:24:02,572 INFO L435 NwaCegarLoop]: 278 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, 278 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:24:02,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:24:02,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-01-09 09:24:02,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-01-09 09:24:02,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 98 states have (on average 1.346938775510204) internal successors, (132), 98 states have internal predecessors, (132), 73 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-01-09 09:24:02,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 278 transitions. [2025-01-09 09:24:02,631 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 278 transitions. Word has length 441 [2025-01-09 09:24:02,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:24:02,632 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 278 transitions. [2025-01-09 09:24:02,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 40.5) internal successors, (81), 2 states have internal predecessors, (81), 2 states have call successors, (73), 2 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 2 states have call successors, (73) [2025-01-09 09:24:02,633 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 278 transitions. [2025-01-09 09:24:02,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-01-09 09:24:02,642 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:24:02,642 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:24:02,650 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 09:24:02,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 09:24:02,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:24:02,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:24:02,845 INFO L85 PathProgramCache]: Analyzing trace with hash 925469586, now seen corresponding path program 1 times [2025-01-09 09:24:02,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:24:02,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900058107] [2025-01-09 09:24:02,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:24:02,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:24:02,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-01-09 09:24:02,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-01-09 09:24:02,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:24:02,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:24:03,424 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 09:24:03,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:24:03,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900058107] [2025-01-09 09:24:03,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900058107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:24:03,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:24:03,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:24:03,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536635666] [2025-01-09 09:24:03,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:24:03,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:24:03,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:24:03,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:24:03,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:24:03,429 INFO L87 Difference]: Start difference. First operand 173 states and 278 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:24:03,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:24:03,493 INFO L93 Difference]: Finished difference Result 513 states and 828 transitions. [2025-01-09 09:24:03,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:24:03,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 441 [2025-01-09 09:24:03,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:24:03,500 INFO L225 Difference]: With dead ends: 513 [2025-01-09 09:24:03,500 INFO L226 Difference]: Without dead ends: 343 [2025-01-09 09:24:03,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:24:03,503 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 132 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:24:03,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 542 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:24:03,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-01-09 09:24:03,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2025-01-09 09:24:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 192 states have (on average 1.34375) internal successors, (258), 192 states have internal predecessors, (258), 146 states have call successors, (146), 2 states have call predecessors, (146), 2 states have return successors, (146), 146 states have call predecessors, (146), 146 states have call successors, (146) [2025-01-09 09:24:03,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 550 transitions. [2025-01-09 09:24:03,576 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 550 transitions. Word has length 441 [2025-01-09 09:24:03,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:24:03,578 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 550 transitions. [2025-01-09 09:24:03,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:24:03,579 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 550 transitions. [2025-01-09 09:24:03,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-01-09 09:24:03,584 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:24:03,585 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:24:03,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:24:03,587 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:24:03,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:24:03,588 INFO L85 PathProgramCache]: Analyzing trace with hash -89469089, now seen corresponding path program 1 times [2025-01-09 09:24:03,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:24:03,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898736840] [2025-01-09 09:24:03,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:24:03,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:24:03,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-01-09 09:24:03,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-01-09 09:24:03,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:24:03,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:24:04,467 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 09:24:04,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:24:04,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898736840] [2025-01-09 09:24:04,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898736840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:24:04,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:24:04,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:24:04,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816225127] [2025-01-09 09:24:04,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:24:04,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:24:04,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:24:04,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:24:04,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:24:04,470 INFO L87 Difference]: Start difference. First operand 341 states and 550 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:24:04,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:24:04,854 INFO L93 Difference]: Finished difference Result 695 states and 1118 transitions. [2025-01-09 09:24:04,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:24:04,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 442 [2025-01-09 09:24:04,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:24:04,860 INFO L225 Difference]: With dead ends: 695 [2025-01-09 09:24:04,861 INFO L226 Difference]: Without dead ends: 357 [2025-01-09 09:24:04,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:24:04,863 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 210 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:24:04,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 934 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:24:04,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-01-09 09:24:04,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 341. [2025-01-09 09:24:04,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 192 states have (on average 1.3385416666666667) internal successors, (257), 192 states have internal predecessors, (257), 146 states have call successors, (146), 2 states have call predecessors, (146), 2 states have return successors, (146), 146 states have call predecessors, (146), 146 states have call successors, (146) [2025-01-09 09:24:04,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 549 transitions. [2025-01-09 09:24:04,920 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 549 transitions. Word has length 442 [2025-01-09 09:24:04,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:24:04,923 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 549 transitions. [2025-01-09 09:24:04,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:24:04,924 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 549 transitions. [2025-01-09 09:24:04,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-01-09 09:24:04,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:24:04,928 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:24:04,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:24:04,928 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:24:04,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:24:04,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1925707467, now seen corresponding path program 1 times [2025-01-09 09:24:04,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:24:04,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907936474] [2025-01-09 09:24:04,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:24:04,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:24:04,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-01-09 09:24:04,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-01-09 09:24:04,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:24:04,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:24:05,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 09:24:05,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:24:05,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907936474] [2025-01-09 09:24:05,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907936474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:24:05,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:24:05,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:24:05,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612014710] [2025-01-09 09:24:05,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:24:05,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:24:05,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:24:05,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:24:05,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:24:05,224 INFO L87 Difference]: Start difference. First operand 341 states and 549 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:24:05,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:24:05,267 INFO L93 Difference]: Finished difference Result 689 states and 1113 transitions. [2025-01-09 09:24:05,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:24:05,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 443 [2025-01-09 09:24:05,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:24:05,272 INFO L225 Difference]: With dead ends: 689 [2025-01-09 09:24:05,272 INFO L226 Difference]: Without dead ends: 351 [2025-01-09 09:24:05,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:24:05,275 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 18 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 563 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 09:24:05,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 563 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:24:05,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-01-09 09:24:05,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 341. [2025-01-09 09:24:05,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 192 states have (on average 1.328125) internal successors, (255), 192 states have internal predecessors, (255), 146 states have call successors, (146), 2 states have call predecessors, (146), 2 states have return successors, (146), 146 states have call predecessors, (146), 146 states have call successors, (146) [2025-01-09 09:24:05,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 547 transitions. [2025-01-09 09:24:05,327 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 547 transitions. Word has length 443 [2025-01-09 09:24:05,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:24:05,329 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 547 transitions. [2025-01-09 09:24:05,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:24:05,330 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 547 transitions. [2025-01-09 09:24:05,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-01-09 09:24:05,334 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:24:05,335 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:24:05,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:24:05,335 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:24:05,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:24:05,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1667542029, now seen corresponding path program 1 times [2025-01-09 09:24:05,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:24:05,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56867257] [2025-01-09 09:24:05,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:24:05,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:24:05,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-01-09 09:24:05,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-01-09 09:24:05,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:24:05,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:24:05,774 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 09:24:05,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:24:05,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56867257] [2025-01-09 09:24:05,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56867257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:24:05,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:24:05,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:24:05,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961526944] [2025-01-09 09:24:05,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:24:05,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:24:05,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:24:05,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:24:05,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:24:05,777 INFO L87 Difference]: Start difference. First operand 341 states and 547 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:24:09,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 09:24:13,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 09:24:17,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 09:24:21,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 09:24:22,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:24:22,140 INFO L93 Difference]: Finished difference Result 1053 states and 1689 transitions. [2025-01-09 09:24:22,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:24:22,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 443 [2025-01-09 09:24:22,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:24:22,150 INFO L225 Difference]: With dead ends: 1053 [2025-01-09 09:24:22,150 INFO L226 Difference]: Without dead ends: 715 [2025-01-09 09:24:22,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:24:22,153 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 333 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 111 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:24:22,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1387 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 152 Invalid, 4 Unknown, 0 Unchecked, 16.3s Time] [2025-01-09 09:24:22,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-01-09 09:24:22,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 541. [2025-01-09 09:24:22,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 336 states have (on average 1.3928571428571428) internal successors, (468), 338 states have internal predecessors, (468), 200 states have call successors, (200), 4 states have call predecessors, (200), 4 states have return successors, (200), 198 states have call predecessors, (200), 200 states have call successors, (200) [2025-01-09 09:24:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 868 transitions. [2025-01-09 09:24:22,241 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 868 transitions. Word has length 443 [2025-01-09 09:24:22,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:24:22,244 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 868 transitions. [2025-01-09 09:24:22,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:24:22,244 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 868 transitions. [2025-01-09 09:24:22,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-01-09 09:24:22,250 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:24:22,250 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:24:22,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:24:22,250 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:24:22,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:24:22,251 INFO L85 PathProgramCache]: Analyzing trace with hash -281338635, now seen corresponding path program 1 times [2025-01-09 09:24:22,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:24:22,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739516506] [2025-01-09 09:24:22,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:24:22,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:24:22,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-01-09 09:24:22,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-01-09 09:24:22,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:24:22,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:24:22,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 09:24:22,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:24:22,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739516506] [2025-01-09 09:24:22,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739516506] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:24:22,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:24:22,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:24:22,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195930180] [2025-01-09 09:24:22,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:24:22,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:24:22,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:24:22,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:24:22,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:24:22,579 INFO L87 Difference]: Start difference. First operand 541 states and 868 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:24:22,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:24:22,672 INFO L93 Difference]: Finished difference Result 1417 states and 2277 transitions. [2025-01-09 09:24:22,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:24:22,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 443 [2025-01-09 09:24:22,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:24:22,682 INFO L225 Difference]: With dead ends: 1417 [2025-01-09 09:24:22,682 INFO L226 Difference]: Without dead ends: 879 [2025-01-09 09:24:22,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:24:22,685 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 150 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:24:22,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 611 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:24:22,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-01-09 09:24:22,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 877. [2025-01-09 09:24:22,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 524 states have (on average 1.3645038167938932) internal successors, (715), 526 states have internal predecessors, (715), 346 states have call successors, (346), 6 states have call predecessors, (346), 6 states have return successors, (346), 344 states have call predecessors, (346), 346 states have call successors, (346) [2025-01-09 09:24:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1407 transitions. [2025-01-09 09:24:22,796 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1407 transitions. Word has length 443 [2025-01-09 09:24:22,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:24:22,797 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1407 transitions. [2025-01-09 09:24:22,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:24:22,798 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1407 transitions. [2025-01-09 09:24:22,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-01-09 09:24:22,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:24:22,802 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:24:22,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:24:22,802 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:24:22,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:24:22,803 INFO L85 PathProgramCache]: Analyzing trace with hash -2051949657, now seen corresponding path program 1 times [2025-01-09 09:24:22,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:24:22,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551021120] [2025-01-09 09:24:22,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:24:22,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:24:22,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes. [2025-01-09 09:24:22,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 444 of 444 statements. [2025-01-09 09:24:22,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:24:22,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:24:23,053 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 09:24:23,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:24:23,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551021120] [2025-01-09 09:24:23,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551021120] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:24:23,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:24:23,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:24:23,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215604971] [2025-01-09 09:24:23,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:24:23,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:24:23,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:24:23,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:24:23,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:24:23,055 INFO L87 Difference]: Start difference. First operand 877 states and 1407 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:24:23,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:24:23,138 INFO L93 Difference]: Finished difference Result 1783 states and 2841 transitions. [2025-01-09 09:24:23,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:24:23,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) Word has length 444 [2025-01-09 09:24:23,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:24:23,146 INFO L225 Difference]: With dead ends: 1783 [2025-01-09 09:24:23,147 INFO L226 Difference]: Without dead ends: 909 [2025-01-09 09:24:23,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:24:23,152 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 33 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:24:23,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 535 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:24:23,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2025-01-09 09:24:23,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 908. [2025-01-09 09:24:23,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 545 states have (on average 1.3394495412844036) internal successors, (730), 548 states have internal predecessors, (730), 350 states have call successors, (350), 12 states have call predecessors, (350), 12 states have return successors, (350), 347 states have call predecessors, (350), 350 states have call successors, (350) [2025-01-09 09:24:23,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1430 transitions. [2025-01-09 09:24:23,258 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1430 transitions. Word has length 444 [2025-01-09 09:24:23,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:24:23,259 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1430 transitions. [2025-01-09 09:24:23,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 1 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 1 states have call predecessors, (73), 1 states have call successors, (73) [2025-01-09 09:24:23,260 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1430 transitions. [2025-01-09 09:24:23,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2025-01-09 09:24:23,264 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:24:23,265 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:24:23,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:24:23,266 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:24:23,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:24:23,266 INFO L85 PathProgramCache]: Analyzing trace with hash -758298674, now seen corresponding path program 1 times [2025-01-09 09:24:23,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:24:23,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272996767] [2025-01-09 09:24:23,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:24:23,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:24:23,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-01-09 09:24:23,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-01-09 09:24:23,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:24:23,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:24:23,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 132 proven. 84 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-01-09 09:24:23,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:24:23,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272996767] [2025-01-09 09:24:23,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272996767] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:24:23,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724717568] [2025-01-09 09:24:23,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:24:23,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:24:23,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:24:23,614 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:24:23,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 09:24:23,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 445 statements into 1 equivalence classes. [2025-01-09 09:24:23,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 445 of 445 statements. [2025-01-09 09:24:23,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:24:23,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:24:23,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 09:24:23,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:24:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 4678 proven. 69 refuted. 0 times theorem prover too weak. 5765 trivial. 0 not checked. [2025-01-09 09:24:24,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:24:24,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 147 proven. 69 refuted. 0 times theorem prover too weak. 10296 trivial. 0 not checked. [2025-01-09 09:24:24,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724717568] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:24:24,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:24:24,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-09 09:24:24,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827918429] [2025-01-09 09:24:24,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:24:24,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:24:24,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:24:24,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:24:24,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:24:24,594 INFO L87 Difference]: Start difference. First operand 908 states and 1430 transitions. Second operand has 9 states, 9 states have (on average 16.11111111111111) internal successors, (145), 9 states have internal predecessors, (145), 4 states have call successors, (124), 2 states have call predecessors, (124), 4 states have return successors, (126), 4 states have call predecessors, (126), 4 states have call successors, (126) [2025-01-09 09:24:25,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:24:25,193 INFO L93 Difference]: Finished difference Result 1864 states and 2890 transitions. [2025-01-09 09:24:25,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 09:24:25,194 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 16.11111111111111) internal successors, (145), 9 states have internal predecessors, (145), 4 states have call successors, (124), 2 states have call predecessors, (124), 4 states have return successors, (126), 4 states have call predecessors, (126), 4 states have call successors, (126) Word has length 445 [2025-01-09 09:24:25,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:24:25,201 INFO L225 Difference]: With dead ends: 1864 [2025-01-09 09:24:25,201 INFO L226 Difference]: Without dead ends: 966 [2025-01-09 09:24:25,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 903 GetRequests, 887 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2025-01-09 09:24:25,204 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 403 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 413 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 413 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:24:25,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 411 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [413 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:24:25,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2025-01-09 09:24:25,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 934. [2025-01-09 09:24:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 563 states have (on average 1.285968028419183) internal successors, (724), 566 states have internal predecessors, (724), 350 states have call successors, (350), 20 states have call predecessors, (350), 20 states have return successors, (350), 347 states have call predecessors, (350), 350 states have call successors, (350) [2025-01-09 09:24:25,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1424 transitions. [2025-01-09 09:24:25,289 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1424 transitions. Word has length 445 [2025-01-09 09:24:25,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:24:25,289 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1424 transitions. [2025-01-09 09:24:25,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.11111111111111) internal successors, (145), 9 states have internal predecessors, (145), 4 states have call successors, (124), 2 states have call predecessors, (124), 4 states have return successors, (126), 4 states have call predecessors, (126), 4 states have call successors, (126) [2025-01-09 09:24:25,290 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1424 transitions. [2025-01-09 09:24:25,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-01-09 09:24:25,292 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:24:25,292 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:24:25,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 09:24:25,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:24:25,492 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:24:25,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:24:25,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1449109558, now seen corresponding path program 1 times [2025-01-09 09:24:25,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:24:25,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311880812] [2025-01-09 09:24:25,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:24:25,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:24:25,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-01-09 09:24:25,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-01-09 09:24:25,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:24:25,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:24:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 264 proven. 162 refuted. 0 times theorem prover too weak. 10086 trivial. 0 not checked. [2025-01-09 09:24:26,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:24:26,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311880812] [2025-01-09 09:24:26,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311880812] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:24:26,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091401162] [2025-01-09 09:24:26,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:24:26,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:24:26,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:24:26,146 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:24:26,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 09:24:26,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-01-09 09:24:26,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-01-09 09:24:26,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:24:26,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:24:26,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 976 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 09:24:26,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:24:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 7489 proven. 162 refuted. 0 times theorem prover too weak. 2861 trivial. 0 not checked. [2025-01-09 09:24:27,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:24:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 264 proven. 165 refuted. 0 times theorem prover too weak. 10083 trivial. 0 not checked. [2025-01-09 09:24:28,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091401162] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:24:28,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:24:28,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 29 [2025-01-09 09:24:28,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546273606] [2025-01-09 09:24:28,384 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:24:28,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 09:24:28,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:24:28,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 09:24:28,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2025-01-09 09:24:28,386 INFO L87 Difference]: Start difference. First operand 934 states and 1424 transitions. Second operand has 29 states, 29 states have (on average 5.9655172413793105) internal successors, (173), 29 states have internal predecessors, (173), 8 states have call successors, (165), 4 states have call predecessors, (165), 9 states have return successors, (165), 8 states have call predecessors, (165), 8 states have call successors, (165) [2025-01-09 09:24:33,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 09:24:37,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 09:24:41,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 09:24:45,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 09:24:49,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 09:24:53,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 09:24:57,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 09:25:01,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 09:25:05,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 09:25:09,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 09:25:13,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 09:25:17,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 09:25:17,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:25:17,597 INFO L93 Difference]: Finished difference Result 2753 states and 4109 transitions. [2025-01-09 09:25:17,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-01-09 09:25:17,598 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.9655172413793105) internal successors, (173), 29 states have internal predecessors, (173), 8 states have call successors, (165), 4 states have call predecessors, (165), 9 states have return successors, (165), 8 states have call predecessors, (165), 8 states have call successors, (165) Word has length 448 [2025-01-09 09:25:17,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:25:17,612 INFO L225 Difference]: With dead ends: 2753 [2025-01-09 09:25:17,612 INFO L226 Difference]: Without dead ends: 1829 [2025-01-09 09:25:17,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 941 GetRequests, 884 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 766 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=946, Invalid=2476, Unknown=0, NotChecked=0, Total=3422 [2025-01-09 09:25:17,618 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 1823 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 2495 mSolverCounterSat, 1382 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1916 SdHoareTripleChecker+Valid, 1517 SdHoareTripleChecker+Invalid, 3888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1382 IncrementalHoareTripleChecker+Valid, 2495 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:25:17,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1916 Valid, 1517 Invalid, 3888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1382 Valid, 2495 Invalid, 11 Unknown, 0 Unchecked, 48.4s Time] [2025-01-09 09:25:17,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2025-01-09 09:25:17,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1048. [2025-01-09 09:25:17,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1048 states, 643 states have (on average 1.2783825816485226) internal successors, (822), 646 states have internal predecessors, (822), 373 states have call successors, (373), 31 states have call predecessors, (373), 31 states have return successors, (373), 370 states have call predecessors, (373), 373 states have call successors, (373) [2025-01-09 09:25:17,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1568 transitions. [2025-01-09 09:25:17,721 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1568 transitions. Word has length 448 [2025-01-09 09:25:17,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:25:17,721 INFO L471 AbstractCegarLoop]: Abstraction has 1048 states and 1568 transitions. [2025-01-09 09:25:17,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.9655172413793105) internal successors, (173), 29 states have internal predecessors, (173), 8 states have call successors, (165), 4 states have call predecessors, (165), 9 states have return successors, (165), 8 states have call predecessors, (165), 8 states have call successors, (165) [2025-01-09 09:25:17,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1568 transitions. [2025-01-09 09:25:17,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-01-09 09:25:17,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:25:17,724 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:25:17,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 09:25:17,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:25:17,928 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:25:17,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:25:17,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1583123064, now seen corresponding path program 1 times [2025-01-09 09:25:17,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:25:17,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654519931] [2025-01-09 09:25:17,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:25:17,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:25:17,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-01-09 09:25:17,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-01-09 09:25:17,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:25:17,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:25:19,274 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10512 trivial. 0 not checked. [2025-01-09 09:25:19,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:25:19,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654519931] [2025-01-09 09:25:19,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654519931] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:25:19,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:25:19,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 09:25:19,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994644552] [2025-01-09 09:25:19,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:25:19,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 09:25:19,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:25:19,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 09:25:19,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 09:25:19,279 INFO L87 Difference]: Start difference. First operand 1048 states and 1568 transitions. Second operand has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 3 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 3 states have call predecessors, (73), 3 states have call successors, (73) [2025-01-09 09:25:22,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:25:22,709 INFO L93 Difference]: Finished difference Result 2749 states and 4078 transitions. [2025-01-09 09:25:22,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 09:25:22,710 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 3 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 3 states have call predecessors, (73), 3 states have call successors, (73) Word has length 448 [2025-01-09 09:25:22,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:25:22,721 INFO L225 Difference]: With dead ends: 2749 [2025-01-09 09:25:22,721 INFO L226 Difference]: Without dead ends: 2147 [2025-01-09 09:25:22,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2025-01-09 09:25:22,724 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 1960 mSDsluCounter, 1220 mSDsCounter, 0 mSdLazyCounter, 1815 mSolverCounterSat, 1560 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1960 SdHoareTripleChecker+Valid, 1637 SdHoareTripleChecker+Invalid, 3375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1560 IncrementalHoareTripleChecker+Valid, 1815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:25:22,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1960 Valid, 1637 Invalid, 3375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1560 Valid, 1815 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 09:25:22,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2025-01-09 09:25:22,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 1307. [2025-01-09 09:25:22,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1307 states, 805 states have (on average 1.26583850931677) internal successors, (1019), 810 states have internal predecessors, (1019), 463 states have call successors, (463), 38 states have call predecessors, (463), 38 states have return successors, (463), 458 states have call predecessors, (463), 463 states have call successors, (463) [2025-01-09 09:25:22,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1945 transitions. [2025-01-09 09:25:22,881 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1945 transitions. Word has length 448 [2025-01-09 09:25:22,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:25:22,882 INFO L471 AbstractCegarLoop]: Abstraction has 1307 states and 1945 transitions. [2025-01-09 09:25:22,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 3 states have call successors, (73), 1 states have call predecessors, (73), 1 states have return successors, (73), 3 states have call predecessors, (73), 3 states have call successors, (73) [2025-01-09 09:25:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1945 transitions. [2025-01-09 09:25:22,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-01-09 09:25:22,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:25:22,886 INFO L218 NwaCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:25:22,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:25:22,886 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:25:22,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:25:22,887 INFO L85 PathProgramCache]: Analyzing trace with hash 906405898, now seen corresponding path program 1 times [2025-01-09 09:25:22,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:25:22,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799265216] [2025-01-09 09:25:22,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:25:22,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:25:22,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-01-09 09:25:23,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-01-09 09:25:23,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:25:23,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:25:24,064 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 261 proven. 165 refuted. 0 times theorem prover too weak. 10086 trivial. 0 not checked. [2025-01-09 09:25:24,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:25:24,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799265216] [2025-01-09 09:25:24,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799265216] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:25:24,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851538316] [2025-01-09 09:25:24,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:25:24,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:25:24,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:25:24,071 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 09:25:24,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 09:25:24,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-01-09 09:25:24,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-01-09 09:25:24,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:25:24,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:25:24,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-01-09 09:25:24,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:25:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 7548 proven. 384 refuted. 0 times theorem prover too weak. 2580 trivial. 0 not checked. [2025-01-09 09:25:26,922 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:25:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 10512 backedges. 444 proven. 402 refuted. 0 times theorem prover too weak. 9666 trivial. 0 not checked. [2025-01-09 09:25:30,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851538316] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:25:30,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:25:30,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23, 23] total 57 [2025-01-09 09:25:30,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786695127] [2025-01-09 09:25:30,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:25:30,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-01-09 09:25:30,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:25:30,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-01-09 09:25:30,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=2764, Unknown=0, NotChecked=0, Total=3192 [2025-01-09 09:25:30,165 INFO L87 Difference]: Start difference. First operand 1307 states and 1945 transitions. Second operand has 57 states, 55 states have (on average 3.9454545454545453) internal successors, (217), 55 states have internal predecessors, (217), 18 states have call successors, (169), 7 states have call predecessors, (169), 15 states have return successors, (169), 15 states have call predecessors, (169), 18 states have call successors, (169)