./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.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_variablewrapping_wrapper-s_file-13.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 89473bb9a9d665e14d1630d8bffc5e3f1f6a66f5c07cc27a72988faba87a0da5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:54:39,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:54:39,625 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:54:39,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:54:39,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:54:39,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:54:39,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:54:39,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:54:39,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:54:39,649 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:54:39,649 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:54:39,649 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:54:39,650 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:54:39,650 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:54:39,650 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:54:39,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:54:39,650 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:54:39,650 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:54:39,650 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:54:39,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:54:39,650 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:54:39,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:54:39,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:54:39,651 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:54:39,651 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:54:39,651 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:54:39,651 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:54:39,651 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:54:39,651 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:54:39,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:54:39,651 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:54:39,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:54:39,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:54:39,651 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:54:39,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:54:39,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:54:39,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:54:39,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:54:39,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:54:39,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:54:39,652 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:54:39,652 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:54:39,653 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:54:39,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:54:39,653 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:54:39,653 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:54:39,653 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:54:39,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:54:39,653 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 -> 89473bb9a9d665e14d1630d8bffc5e3f1f6a66f5c07cc27a72988faba87a0da5 [2025-01-09 15:54:39,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:54:39,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:54:39,904 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:54:39,905 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:54:39,906 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:54:39,906 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i [2025-01-09 15:54:41,076 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd189f7d6/222c6cfc6f7e49a49483728b1fc7b8dc/FLAG6a02a0c7a [2025-01-09 15:54:41,302 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:54:41,303 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i [2025-01-09 15:54:41,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd189f7d6/222c6cfc6f7e49a49483728b1fc7b8dc/FLAG6a02a0c7a [2025-01-09 15:54:41,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bd189f7d6/222c6cfc6f7e49a49483728b1fc7b8dc [2025-01-09 15:54:41,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:54:41,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:54:41,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:54:41,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:54:41,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:54:41,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:54:41" (1/1) ... [2025-01-09 15:54:41,659 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9458d46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:41, skipping insertion in model container [2025-01-09 15:54:41,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:54:41" (1/1) ... [2025-01-09 15:54:41,671 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:54:41,773 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_variablewrapping_wrapper-s_file-13.i[916,929] [2025-01-09 15:54:41,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:54:41,832 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:54:41,840 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_variablewrapping_wrapper-s_file-13.i[916,929] [2025-01-09 15:54:41,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:54:41,903 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:54:41,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:41 WrapperNode [2025-01-09 15:54:41,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:54:41,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:54:41,905 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:54:41,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:54:41,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:41" (1/1) ... [2025-01-09 15:54:41,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:41" (1/1) ... [2025-01-09 15:54:41,965 INFO L138 Inliner]: procedures = 30, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 466 [2025-01-09 15:54:41,965 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:54:41,966 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:54:41,966 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:54:41,966 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:54:41,972 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:41" (1/1) ... [2025-01-09 15:54:41,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:41" (1/1) ... [2025-01-09 15:54:41,979 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:41" (1/1) ... [2025-01-09 15:54:41,989 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-01-09 15:54:41,989 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:41" (1/1) ... [2025-01-09 15:54:41,989 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:41" (1/1) ... [2025-01-09 15:54:42,008 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:41" (1/1) ... [2025-01-09 15:54:42,010 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:41" (1/1) ... [2025-01-09 15:54:42,015 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:41" (1/1) ... [2025-01-09 15:54:42,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:41" (1/1) ... [2025-01-09 15:54:42,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:41" (1/1) ... [2025-01-09 15:54:42,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:54:42,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:54:42,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:54:42,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:54:42,026 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:41" (1/1) ... [2025-01-09 15:54:42,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:54:42,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:54:42,053 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 15:54:42,056 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 15:54:42,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:54:42,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-01-09 15:54:42,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-01-09 15:54:42,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 15:54:42,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-01-09 15:54:42,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-01-09 15:54:42,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 15:54:42,074 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:54:42,074 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:54:42,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 15:54:42,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:54:42,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:54:42,156 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:54:42,157 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:54:42,594 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-01-09 15:54:42,594 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:54:42,606 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:54:42,609 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:54:42,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:54:42 BoogieIcfgContainer [2025-01-09 15:54:42,610 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:54:42,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:54:42,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:54:42,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:54:42,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:54:41" (1/3) ... [2025-01-09 15:54:42,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f08e800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:54:42, skipping insertion in model container [2025-01-09 15:54:42,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:54:41" (2/3) ... [2025-01-09 15:54:42,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f08e800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:54:42, skipping insertion in model container [2025-01-09 15:54:42,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:54:42" (3/3) ... [2025-01-09 15:54:42,618 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-13.i [2025-01-09 15:54:42,631 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:54:42,632 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-13.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:54:42,679 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:54:42,687 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;@825b7be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:54:42,687 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:54:42,691 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 94 states have internal predecessors, (134), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:54:42,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 15:54:42,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:54:42,707 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:42,708 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:54:42,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:54:42,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1409871124, now seen corresponding path program 1 times [2025-01-09 15:54:42,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:54:42,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759987777] [2025-01-09 15:54:42,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:54:42,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:54:42,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:54:42,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:54:42,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:54:42,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:54:42,992 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 15:54:42,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:54:42,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759987777] [2025-01-09 15:54:42,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759987777] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:54:42,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100558369] [2025-01-09 15:54:43,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:54:43,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:54:43,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:54:43,003 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 15:54:43,004 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 15:54:43,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:54:43,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:54:43,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:54:43,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:54:43,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:54:43,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:54:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-01-09 15:54:43,243 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:54:43,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100558369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:54:43,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:54:43,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:54:43,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18638473] [2025-01-09 15:54:43,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:54:43,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:54:43,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:54:43,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:54:43,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:54:43,263 INFO L87 Difference]: Start difference. First operand has 111 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 94 states have internal predecessors, (134), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:54:43,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:54:43,284 INFO L93 Difference]: Finished difference Result 216 states and 338 transitions. [2025-01-09 15:54:43,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:54:43,286 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-01-09 15:54:43,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:54:43,290 INFO L225 Difference]: With dead ends: 216 [2025-01-09 15:54:43,290 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 15:54:43,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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 15:54:43,294 INFO L435 NwaCegarLoop]: 159 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, 159 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 15:54:43,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:54:43,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 15:54:43,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-01-09 15:54:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:54:43,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 159 transitions. [2025-01-09 15:54:43,325 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 159 transitions. Word has length 131 [2025-01-09 15:54:43,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:54:43,326 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 159 transitions. [2025-01-09 15:54:43,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:54:43,326 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 159 transitions. [2025-01-09 15:54:43,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 15:54:43,330 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:54:43,330 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:43,337 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 15:54:43,531 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 15:54:43,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:54:43,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:54:43,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1635196438, now seen corresponding path program 1 times [2025-01-09 15:54:43,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:54:43,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640267975] [2025-01-09 15:54:43,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:54:43,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:54:43,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:54:43,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:54:43,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:54:43,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:54:43,825 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:54:43,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:54:43,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640267975] [2025-01-09 15:54:43,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640267975] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:54:43,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:54:43,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:54:43,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232482608] [2025-01-09 15:54:43,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:54:43,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:54:43,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:54:43,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:54:43,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:54:43,827 INFO L87 Difference]: Start difference. First operand 108 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:54:43,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:54:43,854 INFO L93 Difference]: Finished difference Result 215 states and 318 transitions. [2025-01-09 15:54:43,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:54:43,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-01-09 15:54:43,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:54:43,856 INFO L225 Difference]: With dead ends: 215 [2025-01-09 15:54:43,856 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 15:54:43,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:54:43,857 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:54:43,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:54:43,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 15:54:43,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-01-09 15:54:43,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:54:43,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 161 transitions. [2025-01-09 15:54:43,868 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 161 transitions. Word has length 131 [2025-01-09 15:54:43,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:54:43,869 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 161 transitions. [2025-01-09 15:54:43,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:54:43,869 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 161 transitions. [2025-01-09 15:54:43,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 15:54:43,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:54:43,871 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:43,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:54:43,871 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:54:43,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:54:43,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1387049944, now seen corresponding path program 1 times [2025-01-09 15:54:43,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:54:43,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872409462] [2025-01-09 15:54:43,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:54:43,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:54:43,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:54:43,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:54:43,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:54:43,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:54:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:54:43,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:54:43,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872409462] [2025-01-09 15:54:43,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872409462] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:54:43,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:54:43,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:54:43,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376562252] [2025-01-09 15:54:43,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:54:43,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:54:43,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:54:43,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:54:43,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:54:43,984 INFO L87 Difference]: Start difference. First operand 110 states and 161 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:54:44,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:54:44,008 INFO L93 Difference]: Finished difference Result 218 states and 321 transitions. [2025-01-09 15:54:44,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:54:44,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-01-09 15:54:44,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:54:44,011 INFO L225 Difference]: With dead ends: 218 [2025-01-09 15:54:44,012 INFO L226 Difference]: Without dead ends: 111 [2025-01-09 15:54:44,013 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 15:54:44,014 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 310 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 15:54:44,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 310 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:54:44,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-01-09 15:54:44,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-01-09 15:54:44,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:54:44,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 162 transitions. [2025-01-09 15:54:44,025 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 162 transitions. Word has length 131 [2025-01-09 15:54:44,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:54:44,025 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 162 transitions. [2025-01-09 15:54:44,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:54:44,026 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 162 transitions. [2025-01-09 15:54:44,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 15:54:44,029 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:54:44,029 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:44,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:54:44,029 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:54:44,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:54:44,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1319569450, now seen corresponding path program 1 times [2025-01-09 15:54:44,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:54:44,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134893773] [2025-01-09 15:54:44,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:54:44,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:54:44,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:54:44,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:54:44,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:54:44,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:54:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 15:54:44,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:54:44,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134893773] [2025-01-09 15:54:44,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134893773] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:54:44,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770869373] [2025-01-09 15:54:44,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:54:44,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:54:44,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:54:44,280 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 15:54:44,282 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 15:54:44,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:54:44,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:54:44,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:54:44,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:54:44,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:54:44,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:54:44,489 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:54:44,489 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:54:44,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770869373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:54:44,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:54:44,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-01-09 15:54:44,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659765484] [2025-01-09 15:54:44,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:54:44,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:54:44,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:54:44,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:54:44,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:54:44,491 INFO L87 Difference]: Start difference. First operand 111 states and 162 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:54:44,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:54:44,519 INFO L93 Difference]: Finished difference Result 221 states and 324 transitions. [2025-01-09 15:54:44,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:54:44,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-01-09 15:54:44,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:54:44,521 INFO L225 Difference]: With dead ends: 221 [2025-01-09 15:54:44,521 INFO L226 Difference]: Without dead ends: 113 [2025-01-09 15:54:44,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:54:44,522 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:54:44,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:54:44,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-01-09 15:54:44,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-01-09 15:54:44,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:54:44,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 164 transitions. [2025-01-09 15:54:44,532 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 164 transitions. Word has length 131 [2025-01-09 15:54:44,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:54:44,532 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 164 transitions. [2025-01-09 15:54:44,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:54:44,533 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 164 transitions. [2025-01-09 15:54:44,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 15:54:44,535 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:54:44,536 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:44,542 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 15:54:44,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:54:44,740 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:54:44,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:54:44,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1760580687, now seen corresponding path program 1 times [2025-01-09 15:54:44,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:54:44,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098401963] [2025-01-09 15:54:44,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:54:44,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:54:44,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 15:54:44,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 15:54:44,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:54:44,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:54:45,817 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:54:45,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:54:45,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098401963] [2025-01-09 15:54:45,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098401963] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:54:45,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:54:45,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:54:45,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556153418] [2025-01-09 15:54:45,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:54:45,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:54:45,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:54:45,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:54:45,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:54:45,821 INFO L87 Difference]: Start difference. First operand 113 states and 164 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:54:46,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:54:46,017 INFO L93 Difference]: Finished difference Result 332 states and 485 transitions. [2025-01-09 15:54:46,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:54:46,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2025-01-09 15:54:46,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:54:46,019 INFO L225 Difference]: With dead ends: 332 [2025-01-09 15:54:46,019 INFO L226 Difference]: Without dead ends: 222 [2025-01-09 15:54:46,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:54:46,021 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 101 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:54:46,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 269 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:54:46,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-01-09 15:54:46,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 218. [2025-01-09 15:54:46,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 185 states have (on average 1.4) internal successors, (259), 185 states have internal predecessors, (259), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:54:46,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 319 transitions. [2025-01-09 15:54:46,037 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 319 transitions. Word has length 133 [2025-01-09 15:54:46,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:54:46,038 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 319 transitions. [2025-01-09 15:54:46,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:54:46,039 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 319 transitions. [2025-01-09 15:54:46,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 15:54:46,040 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:54:46,041 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:46,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:54:46,041 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:54:46,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:54:46,041 INFO L85 PathProgramCache]: Analyzing trace with hash 27794417, now seen corresponding path program 1 times [2025-01-09 15:54:46,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:54:46,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843995394] [2025-01-09 15:54:46,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:54:46,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:54:46,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 15:54:46,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 15:54:46,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:54:46,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:54:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:54:46,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:54:46,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843995394] [2025-01-09 15:54:46,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843995394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:54:46,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:54:46,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:54:46,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334013062] [2025-01-09 15:54:46,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:54:46,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:54:46,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:54:46,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:54:46,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:54:46,312 INFO L87 Difference]: Start difference. First operand 218 states and 319 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:54:46,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:54:46,429 INFO L93 Difference]: Finished difference Result 435 states and 637 transitions. [2025-01-09 15:54:46,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:54:46,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2025-01-09 15:54:46,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:54:46,433 INFO L225 Difference]: With dead ends: 435 [2025-01-09 15:54:46,434 INFO L226 Difference]: Without dead ends: 220 [2025-01-09 15:54:46,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:54:46,435 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 4 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:54:46,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 382 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:54:46,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-01-09 15:54:46,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2025-01-09 15:54:46,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 185 states have (on average 1.3891891891891892) internal successors, (257), 185 states have internal predecessors, (257), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:54:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 317 transitions. [2025-01-09 15:54:46,446 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 317 transitions. Word has length 133 [2025-01-09 15:54:46,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:54:46,446 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 317 transitions. [2025-01-09 15:54:46,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:54:46,446 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 317 transitions. [2025-01-09 15:54:46,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 15:54:46,447 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:54:46,447 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:46,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:54:46,447 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:54:46,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:54:46,448 INFO L85 PathProgramCache]: Analyzing trace with hash 285959855, now seen corresponding path program 1 times [2025-01-09 15:54:46,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:54:46,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309259340] [2025-01-09 15:54:46,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:54:46,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:54:46,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 15:54:46,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 15:54:46,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:54:46,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:54:47,405 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:54:47,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:54:47,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309259340] [2025-01-09 15:54:47,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309259340] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:54:47,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:54:47,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:54:47,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187301349] [2025-01-09 15:54:47,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:54:47,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:54:47,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:54:47,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:54:47,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:54:47,407 INFO L87 Difference]: Start difference. First operand 218 states and 317 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:54:47,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:54:47,704 INFO L93 Difference]: Finished difference Result 482 states and 700 transitions. [2025-01-09 15:54:47,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:54:47,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2025-01-09 15:54:47,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:54:47,705 INFO L225 Difference]: With dead ends: 482 [2025-01-09 15:54:47,705 INFO L226 Difference]: Without dead ends: 267 [2025-01-09 15:54:47,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:54:47,706 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 112 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:54:47,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 424 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:54:47,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-01-09 15:54:47,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 224. [2025-01-09 15:54:47,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 191 states have (on average 1.382198952879581) internal successors, (264), 191 states have internal predecessors, (264), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:54:47,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 324 transitions. [2025-01-09 15:54:47,717 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 324 transitions. Word has length 133 [2025-01-09 15:54:47,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:54:47,717 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 324 transitions. [2025-01-09 15:54:47,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:54:47,717 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 324 transitions. [2025-01-09 15:54:47,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 15:54:47,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:54:47,718 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:47,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:54:47,718 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:54:47,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:54:47,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1302388047, now seen corresponding path program 1 times [2025-01-09 15:54:47,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:54:47,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362124922] [2025-01-09 15:54:47,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:54:47,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:54:47,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 15:54:47,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 15:54:47,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:54:47,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:54:47,905 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:54:47,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:54:47,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362124922] [2025-01-09 15:54:47,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362124922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:54:47,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:54:47,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:54:47,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106940077] [2025-01-09 15:54:47,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:54:47,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:54:47,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:54:47,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:54:47,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:54:47,907 INFO L87 Difference]: Start difference. First operand 224 states and 324 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:54:48,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:54:48,145 INFO L93 Difference]: Finished difference Result 478 states and 692 transitions. [2025-01-09 15:54:48,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:54:48,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 133 [2025-01-09 15:54:48,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:54:48,149 INFO L225 Difference]: With dead ends: 478 [2025-01-09 15:54:48,149 INFO L226 Difference]: Without dead ends: 257 [2025-01-09 15:54:48,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:54:48,150 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 48 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:54:48,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 439 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:54:48,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-01-09 15:54:48,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 226. [2025-01-09 15:54:48,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 193 states have (on average 1.383419689119171) internal successors, (267), 193 states have internal predecessors, (267), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:54:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 327 transitions. [2025-01-09 15:54:48,169 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 327 transitions. Word has length 133 [2025-01-09 15:54:48,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:54:48,169 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 327 transitions. [2025-01-09 15:54:48,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:54:48,170 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 327 transitions. [2025-01-09 15:54:48,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 15:54:48,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:54:48,171 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:48,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:54:48,172 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:54:48,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:54:48,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1843534508, now seen corresponding path program 1 times [2025-01-09 15:54:48,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:54:48,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539673777] [2025-01-09 15:54:48,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:54:48,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:54:48,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 15:54:48,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 15:54:48,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:54:48,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:54:48,910 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:54:48,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:54:48,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539673777] [2025-01-09 15:54:48,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539673777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:54:48,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:54:48,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:54:48,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038979489] [2025-01-09 15:54:48,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:54:48,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:54:48,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:54:48,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:54:48,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:54:48,912 INFO L87 Difference]: Start difference. First operand 226 states and 327 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:54:49,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:54:49,097 INFO L93 Difference]: Finished difference Result 453 states and 655 transitions. [2025-01-09 15:54:49,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:54:49,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2025-01-09 15:54:49,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:54:49,099 INFO L225 Difference]: With dead ends: 453 [2025-01-09 15:54:49,099 INFO L226 Difference]: Without dead ends: 230 [2025-01-09 15:54:49,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:54:49,100 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 85 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:54:49,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 271 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:54:49,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-01-09 15:54:49,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 226. [2025-01-09 15:54:49,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 193 states have (on average 1.378238341968912) internal successors, (266), 193 states have internal predecessors, (266), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 15:54:49,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 326 transitions. [2025-01-09 15:54:49,116 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 326 transitions. Word has length 134 [2025-01-09 15:54:49,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:54:49,117 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 326 transitions. [2025-01-09 15:54:49,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:54:49,118 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 326 transitions. [2025-01-09 15:54:49,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 15:54:49,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:54:49,119 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:49,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:54:49,119 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:54:49,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:54:49,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1750368210, now seen corresponding path program 1 times [2025-01-09 15:54:49,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:54:49,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313713799] [2025-01-09 15:54:49,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:54:49,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:54:49,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 15:54:49,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 15:54:49,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:54:49,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:54:50,177 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:54:50,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:54:50,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313713799] [2025-01-09 15:54:50,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313713799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:54:50,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:54:50,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:54:50,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740571806] [2025-01-09 15:54:50,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:54:50,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:54:50,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:54:50,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:54:50,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:54:50,179 INFO L87 Difference]: Start difference. First operand 226 states and 326 transitions. Second operand has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:54:50,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:54:50,696 INFO L93 Difference]: Finished difference Result 556 states and 795 transitions. [2025-01-09 15:54:50,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:54:50,696 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-01-09 15:54:50,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:54:50,698 INFO L225 Difference]: With dead ends: 556 [2025-01-09 15:54:50,698 INFO L226 Difference]: Without dead ends: 333 [2025-01-09 15:54:50,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:54:50,699 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 114 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:54:50,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 462 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:54:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-01-09 15:54:50,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 327. [2025-01-09 15:54:50,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 288 states have (on average 1.3784722222222223) internal successors, (397), 290 states have internal predecessors, (397), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-01-09 15:54:50,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 465 transitions. [2025-01-09 15:54:50,721 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 465 transitions. Word has length 134 [2025-01-09 15:54:50,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:54:50,721 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 465 transitions. [2025-01-09 15:54:50,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:54:50,722 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 465 transitions. [2025-01-09 15:54:50,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 15:54:50,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:54:50,723 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:50,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:54:50,723 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:54:50,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:54:50,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2143395220, now seen corresponding path program 1 times [2025-01-09 15:54:50,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:54:50,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376178210] [2025-01-09 15:54:50,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:54:50,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:54:50,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 15:54:50,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 15:54:50,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:54:50,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:54:50,946 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:54:50,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:54:50,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376178210] [2025-01-09 15:54:50,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376178210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:54:50,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:54:50,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:54:50,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868380728] [2025-01-09 15:54:50,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:54:50,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:54:50,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:54:50,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:54:50,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:54:50,948 INFO L87 Difference]: Start difference. First operand 327 states and 465 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:54:51,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:54:51,361 INFO L93 Difference]: Finished difference Result 794 states and 1131 transitions. [2025-01-09 15:54:51,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:54:51,361 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2025-01-09 15:54:51,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:54:51,365 INFO L225 Difference]: With dead ends: 794 [2025-01-09 15:54:51,366 INFO L226 Difference]: Without dead ends: 470 [2025-01-09 15:54:51,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:54:51,369 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 134 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:54:51,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1509 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:54:51,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-01-09 15:54:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 443. [2025-01-09 15:54:51,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 373 states have (on average 1.353887399463807) internal successors, (505), 376 states have internal predecessors, (505), 62 states have call successors, (62), 7 states have call predecessors, (62), 7 states have return successors, (62), 59 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 15:54:51,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 629 transitions. [2025-01-09 15:54:51,401 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 629 transitions. Word has length 134 [2025-01-09 15:54:51,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:54:51,401 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 629 transitions. [2025-01-09 15:54:51,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:54:51,401 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 629 transitions. [2025-01-09 15:54:51,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 15:54:51,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:54:51,402 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:51,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:54:51,402 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:54:51,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:54:51,403 INFO L85 PathProgramCache]: Analyzing trace with hash -932719760, now seen corresponding path program 1 times [2025-01-09 15:54:51,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:54:51,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714480960] [2025-01-09 15:54:51,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:54:51,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:54:51,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 15:54:51,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 15:54:51,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:54:51,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:54:51,650 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:54:51,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:54:51,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714480960] [2025-01-09 15:54:51,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714480960] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:54:51,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:54:51,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:54:51,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820980106] [2025-01-09 15:54:51,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:54:51,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:54:51,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:54:51,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:54:51,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:54:51,654 INFO L87 Difference]: Start difference. First operand 443 states and 629 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:54:51,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:54:51,940 INFO L93 Difference]: Finished difference Result 897 states and 1270 transitions. [2025-01-09 15:54:51,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:54:51,941 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2025-01-09 15:54:51,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:54:51,945 INFO L225 Difference]: With dead ends: 897 [2025-01-09 15:54:51,945 INFO L226 Difference]: Without dead ends: 466 [2025-01-09 15:54:51,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:54:51,946 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 66 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:54:51,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1293 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:54:51,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-01-09 15:54:51,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 402. [2025-01-09 15:54:51,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 344 states have (on average 1.3488372093023255) internal successors, (464), 346 states have internal predecessors, (464), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 15:54:51,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 564 transitions. [2025-01-09 15:54:51,974 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 564 transitions. Word has length 134 [2025-01-09 15:54:51,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:54:51,974 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 564 transitions. [2025-01-09 15:54:51,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:54:51,975 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 564 transitions. [2025-01-09 15:54:51,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 15:54:51,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:54:51,976 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:51,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:54:51,976 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:54:51,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:54:51,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1325746770, now seen corresponding path program 1 times [2025-01-09 15:54:51,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:54:51,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121650477] [2025-01-09 15:54:51,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:54:51,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:54:52,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 15:54:52,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 15:54:52,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:54:52,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:54:52,783 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:54:52,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:54:52,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121650477] [2025-01-09 15:54:52,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121650477] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:54:52,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:54:52,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:54:52,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346939216] [2025-01-09 15:54:52,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:54:52,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:54:52,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:54:52,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:54:52,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:54:52,785 INFO L87 Difference]: Start difference. First operand 402 states and 564 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:54:53,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:54:53,503 INFO L93 Difference]: Finished difference Result 1266 states and 1774 transitions. [2025-01-09 15:54:53,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:54:53,504 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-01-09 15:54:53,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:54:53,507 INFO L225 Difference]: With dead ends: 1266 [2025-01-09 15:54:53,507 INFO L226 Difference]: Without dead ends: 867 [2025-01-09 15:54:53,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:54:53,508 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 300 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:54:53,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 908 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:54:53,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2025-01-09 15:54:53,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 860. [2025-01-09 15:54:53,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 741 states have (on average 1.3468286099865048) internal successors, (998), 746 states have internal predecessors, (998), 102 states have call successors, (102), 16 states have call predecessors, (102), 16 states have return successors, (102), 97 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 15:54:53,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1202 transitions. [2025-01-09 15:54:53,548 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1202 transitions. Word has length 134 [2025-01-09 15:54:53,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:54:53,548 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 1202 transitions. [2025-01-09 15:54:53,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:54:53,548 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1202 transitions. [2025-01-09 15:54:53,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 15:54:53,550 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:54:53,550 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:53,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:54:53,550 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:54:53,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:54:53,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1185198160, now seen corresponding path program 1 times [2025-01-09 15:54:53,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:54:53,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672314130] [2025-01-09 15:54:53,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:54:53,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:54:53,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 15:54:53,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 15:54:53,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:54:53,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:54:54,603 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:54:54,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:54:54,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672314130] [2025-01-09 15:54:54,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672314130] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:54:54,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:54:54,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:54:54,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549302123] [2025-01-09 15:54:54,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:54:54,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:54:54,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:54:54,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:54:54,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:54:54,604 INFO L87 Difference]: Start difference. First operand 860 states and 1202 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:54:55,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:54:55,356 INFO L93 Difference]: Finished difference Result 1785 states and 2488 transitions. [2025-01-09 15:54:55,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:54:55,356 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-01-09 15:54:55,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:54:55,362 INFO L225 Difference]: With dead ends: 1785 [2025-01-09 15:54:55,362 INFO L226 Difference]: Without dead ends: 928 [2025-01-09 15:54:55,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:54:55,364 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 265 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:54:55,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 797 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:54:55,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2025-01-09 15:54:55,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 462. [2025-01-09 15:54:55,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 400 states have (on average 1.345) internal successors, (538), 403 states have internal predecessors, (538), 52 states have call successors, (52), 9 states have call predecessors, (52), 9 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:54:55,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 642 transitions. [2025-01-09 15:54:55,399 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 642 transitions. Word has length 134 [2025-01-09 15:54:55,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:54:55,399 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 642 transitions. [2025-01-09 15:54:55,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:54:55,399 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 642 transitions. [2025-01-09 15:54:55,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 15:54:55,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:54:55,400 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:55,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 15:54:55,401 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:54:55,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:54:55,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1813625548, now seen corresponding path program 1 times [2025-01-09 15:54:55,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:54:55,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527204946] [2025-01-09 15:54:55,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:54:55,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:54:55,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 15:54:55,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 15:54:55,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:54:55,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:54:55,604 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:54:55,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:54:55,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527204946] [2025-01-09 15:54:55,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527204946] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:54:55,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:54:55,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:54:55,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008858808] [2025-01-09 15:54:55,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:54:55,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:54:55,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:54:55,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:54:55,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:54:55,606 INFO L87 Difference]: Start difference. First operand 462 states and 642 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:54:56,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:54:56,243 INFO L93 Difference]: Finished difference Result 1421 states and 1980 transitions. [2025-01-09 15:54:56,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:54:56,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-01-09 15:54:56,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:54:56,247 INFO L225 Difference]: With dead ends: 1421 [2025-01-09 15:54:56,248 INFO L226 Difference]: Without dead ends: 1121 [2025-01-09 15:54:56,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:54:56,250 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 310 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:54:56,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 868 Invalid, 722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:54:56,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2025-01-09 15:54:56,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1115. [2025-01-09 15:54:56,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 957 states have (on average 1.3406478578892371) internal successors, (1283), 964 states have internal predecessors, (1283), 134 states have call successors, (134), 23 states have call predecessors, (134), 23 states have return successors, (134), 127 states have call predecessors, (134), 134 states have call successors, (134) [2025-01-09 15:54:56,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1551 transitions. [2025-01-09 15:54:56,305 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1551 transitions. Word has length 135 [2025-01-09 15:54:56,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:54:56,305 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1551 transitions. [2025-01-09 15:54:56,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:54:56,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1551 transitions. [2025-01-09 15:54:56,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 15:54:56,319 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:54:56,319 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:56,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 15:54:56,320 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:54:56,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:54:56,320 INFO L85 PathProgramCache]: Analyzing trace with hash -25250444, now seen corresponding path program 1 times [2025-01-09 15:54:56,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:54:56,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863763040] [2025-01-09 15:54:56,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:54:56,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:54:56,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 15:54:56,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 15:54:56,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:54:56,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:54:56,418 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:54:56,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:54:56,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863763040] [2025-01-09 15:54:56,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863763040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:54:56,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:54:56,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:54:56,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130876782] [2025-01-09 15:54:56,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:54:56,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:54:56,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:54:56,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:54:56,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:54:56,420 INFO L87 Difference]: Start difference. First operand 1115 states and 1551 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:54:56,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:54:56,460 INFO L93 Difference]: Finished difference Result 1909 states and 2665 transitions. [2025-01-09 15:54:56,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:54:56,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-01-09 15:54:56,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:54:56,465 INFO L225 Difference]: With dead ends: 1909 [2025-01-09 15:54:56,465 INFO L226 Difference]: Without dead ends: 1115 [2025-01-09 15:54:56,466 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 15:54:56,467 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:54:56,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 308 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:54:56,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-01-09 15:54:56,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2025-01-09 15:54:56,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 957 states have (on average 1.3385579937304075) internal successors, (1281), 964 states have internal predecessors, (1281), 134 states have call successors, (134), 23 states have call predecessors, (134), 23 states have return successors, (134), 127 states have call predecessors, (134), 134 states have call successors, (134) [2025-01-09 15:54:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1549 transitions. [2025-01-09 15:54:56,515 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1549 transitions. Word has length 135 [2025-01-09 15:54:56,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:54:56,516 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1549 transitions. [2025-01-09 15:54:56,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:54:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1549 transitions. [2025-01-09 15:54:56,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 15:54:56,517 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:54:56,517 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:56,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 15:54:56,518 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:54:56,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:54:56,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1830688778, now seen corresponding path program 1 times [2025-01-09 15:54:56,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:54:56,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876790076] [2025-01-09 15:54:56,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:54:56,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:54:56,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 15:54:56,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 15:54:56,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:54:56,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:54:57,114 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:54:57,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:54:57,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876790076] [2025-01-09 15:54:57,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876790076] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:54:57,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:54:57,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:54:57,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485806918] [2025-01-09 15:54:57,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:54:57,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:54:57,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:54:57,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:54:57,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:54:57,116 INFO L87 Difference]: Start difference. First operand 1115 states and 1549 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:54:58,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:54:58,169 INFO L93 Difference]: Finished difference Result 1363 states and 1889 transitions. [2025-01-09 15:54:58,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 15:54:58,170 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-01-09 15:54:58,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:54:58,175 INFO L225 Difference]: With dead ends: 1363 [2025-01-09 15:54:58,175 INFO L226 Difference]: Without dead ends: 1121 [2025-01-09 15:54:58,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:54:58,177 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 266 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:54:58,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 1413 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 15:54:58,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2025-01-09 15:54:58,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1109. [2025-01-09 15:54:58,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 951 states have (on average 1.337539432176656) internal successors, (1272), 958 states have internal predecessors, (1272), 134 states have call successors, (134), 23 states have call predecessors, (134), 23 states have return successors, (134), 127 states have call predecessors, (134), 134 states have call successors, (134) [2025-01-09 15:54:58,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1540 transitions. [2025-01-09 15:54:58,221 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1540 transitions. Word has length 135 [2025-01-09 15:54:58,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:54:58,222 INFO L471 AbstractCegarLoop]: Abstraction has 1109 states and 1540 transitions. [2025-01-09 15:54:58,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:54:58,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1540 transitions. [2025-01-09 15:54:58,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 15:54:58,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:54:58,224 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:54:58,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 15:54:58,225 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:54:58,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:54:58,225 INFO L85 PathProgramCache]: Analyzing trace with hash 737943028, now seen corresponding path program 1 times [2025-01-09 15:54:58,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:54:58,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729269377] [2025-01-09 15:54:58,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:54:58,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:54:58,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 15:54:58,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 15:54:58,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:54:58,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:54:58,901 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:54:58,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:54:58,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729269377] [2025-01-09 15:54:58,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729269377] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:54:58,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:54:58,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:54:58,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887488490] [2025-01-09 15:54:58,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:54:58,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:54:58,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:54:58,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:54:58,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:54:58,903 INFO L87 Difference]: Start difference. First operand 1109 states and 1540 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:00,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:55:00,641 INFO L93 Difference]: Finished difference Result 2332 states and 3241 transitions. [2025-01-09 15:55:00,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 15:55:00,642 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-01-09 15:55:00,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:55:00,647 INFO L225 Difference]: With dead ends: 2332 [2025-01-09 15:55:00,647 INFO L226 Difference]: Without dead ends: 1544 [2025-01-09 15:55:00,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2025-01-09 15:55:00,649 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 370 mSDsluCounter, 1810 mSDsCounter, 0 mSdLazyCounter, 1854 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 1921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:55:00,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 2111 Invalid, 1921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1854 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 15:55:00,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2025-01-09 15:55:00,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1316. [2025-01-09 15:55:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1123 states have (on average 1.3365983971504898) internal successors, (1501), 1131 states have internal predecessors, (1501), 164 states have call successors, (164), 28 states have call predecessors, (164), 28 states have return successors, (164), 156 states have call predecessors, (164), 164 states have call successors, (164) [2025-01-09 15:55:00,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1829 transitions. [2025-01-09 15:55:00,705 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1829 transitions. Word has length 135 [2025-01-09 15:55:00,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:55:00,705 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 1829 transitions. [2025-01-09 15:55:00,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:00,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1829 transitions. [2025-01-09 15:55:00,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 15:55:00,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:55:00,707 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:55:00,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 15:55:00,707 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:55:00,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:55:00,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1768649164, now seen corresponding path program 1 times [2025-01-09 15:55:00,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:55:00,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514511083] [2025-01-09 15:55:00,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:55:00,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:55:00,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 15:55:00,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 15:55:00,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:55:00,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:55:01,459 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:55:01,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:55:01,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514511083] [2025-01-09 15:55:01,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514511083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:55:01,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:55:01,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:55:01,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50557740] [2025-01-09 15:55:01,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:55:01,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:55:01,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:55:01,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:55:01,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:55:01,462 INFO L87 Difference]: Start difference. First operand 1316 states and 1829 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:02,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:55:02,215 INFO L93 Difference]: Finished difference Result 1795 states and 2493 transitions. [2025-01-09 15:55:02,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:55:02,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 135 [2025-01-09 15:55:02,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:55:02,219 INFO L225 Difference]: With dead ends: 1795 [2025-01-09 15:55:02,219 INFO L226 Difference]: Without dead ends: 800 [2025-01-09 15:55:02,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:55:02,221 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 350 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:55:02,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1022 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:55:02,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-01-09 15:55:02,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 790. [2025-01-09 15:55:02,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 672 states have (on average 1.3258928571428572) internal successors, (891), 675 states have internal predecessors, (891), 100 states have call successors, (100), 17 states have call predecessors, (100), 17 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 15:55:02,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1091 transitions. [2025-01-09 15:55:02,254 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1091 transitions. Word has length 135 [2025-01-09 15:55:02,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:55:02,254 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1091 transitions. [2025-01-09 15:55:02,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:02,255 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1091 transitions. [2025-01-09 15:55:02,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 15:55:02,256 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:55:02,256 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:55:02,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 15:55:02,256 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:55:02,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:55:02,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1648886265, now seen corresponding path program 1 times [2025-01-09 15:55:02,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:55:02,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361393614] [2025-01-09 15:55:02,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:55:02,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:55:02,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 15:55:02,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 15:55:02,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:55:02,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:55:02,492 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:55:02,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:55:02,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361393614] [2025-01-09 15:55:02,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361393614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:55:02,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:55:02,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:55:02,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730361870] [2025-01-09 15:55:02,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:55:02,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:55:02,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:55:02,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:55:02,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:55:02,494 INFO L87 Difference]: Start difference. First operand 790 states and 1091 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:03,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:55:03,091 INFO L93 Difference]: Finished difference Result 1028 states and 1418 transitions. [2025-01-09 15:55:03,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:55:03,093 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2025-01-09 15:55:03,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:55:03,096 INFO L225 Difference]: With dead ends: 1028 [2025-01-09 15:55:03,096 INFO L226 Difference]: Without dead ends: 792 [2025-01-09 15:55:03,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:55:03,097 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 272 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:55:03,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 998 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:55:03,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-01-09 15:55:03,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 786. [2025-01-09 15:55:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 668 states have (on average 1.3233532934131738) internal successors, (884), 671 states have internal predecessors, (884), 100 states have call successors, (100), 17 states have call predecessors, (100), 17 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 15:55:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1084 transitions. [2025-01-09 15:55:03,134 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1084 transitions. Word has length 136 [2025-01-09 15:55:03,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:55:03,134 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1084 transitions. [2025-01-09 15:55:03,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1084 transitions. [2025-01-09 15:55:03,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 15:55:03,135 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:55:03,136 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:55:03,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 15:55:03,136 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:55:03,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:55:03,137 INFO L85 PathProgramCache]: Analyzing trace with hash 977325961, now seen corresponding path program 1 times [2025-01-09 15:55:03,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:55:03,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173971897] [2025-01-09 15:55:03,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:55:03,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:55:03,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 15:55:03,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 15:55:03,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:55:03,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:55:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:55:03,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:55:03,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173971897] [2025-01-09 15:55:03,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173971897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:55:03,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:55:03,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:55:03,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261418144] [2025-01-09 15:55:03,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:55:03,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:55:03,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:55:03,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:55:03,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:55:03,271 INFO L87 Difference]: Start difference. First operand 786 states and 1084 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:03,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:55:03,441 INFO L93 Difference]: Finished difference Result 1352 states and 1864 transitions. [2025-01-09 15:55:03,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:55:03,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 136 [2025-01-09 15:55:03,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:55:03,444 INFO L225 Difference]: With dead ends: 1352 [2025-01-09 15:55:03,444 INFO L226 Difference]: Without dead ends: 875 [2025-01-09 15:55:03,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:55:03,446 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 51 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:55:03,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 516 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:55:03,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-01-09 15:55:03,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 786. [2025-01-09 15:55:03,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 668 states have (on average 1.31437125748503) internal successors, (878), 671 states have internal predecessors, (878), 100 states have call successors, (100), 17 states have call predecessors, (100), 17 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 15:55:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1078 transitions. [2025-01-09 15:55:03,478 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1078 transitions. Word has length 136 [2025-01-09 15:55:03,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:55:03,478 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1078 transitions. [2025-01-09 15:55:03,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1078 transitions. [2025-01-09 15:55:03,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 15:55:03,480 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:55:03,480 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:55:03,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 15:55:03,480 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:55:03,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:55:03,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1016818745, now seen corresponding path program 1 times [2025-01-09 15:55:03,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:55:03,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696980824] [2025-01-09 15:55:03,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:55:03,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:55:03,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 15:55:03,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 15:55:03,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:55:03,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:55:03,993 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:55:03,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:55:03,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696980824] [2025-01-09 15:55:03,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696980824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:55:03,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:55:03,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:55:03,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281525368] [2025-01-09 15:55:03,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:55:03,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:55:03,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:55:03,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:55:03,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:55:03,995 INFO L87 Difference]: Start difference. First operand 786 states and 1078 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:55:04,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:55:04,263 INFO L93 Difference]: Finished difference Result 1642 states and 2247 transitions. [2025-01-09 15:55:04,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:55:04,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-01-09 15:55:04,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:55:04,268 INFO L225 Difference]: With dead ends: 1642 [2025-01-09 15:55:04,269 INFO L226 Difference]: Without dead ends: 859 [2025-01-09 15:55:04,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:55:04,271 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 54 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:55:04,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 574 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:55:04,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2025-01-09 15:55:04,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 770. [2025-01-09 15:55:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 652 states have (on average 1.2929447852760736) internal successors, (843), 655 states have internal predecessors, (843), 100 states have call successors, (100), 17 states have call predecessors, (100), 17 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 15:55:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1043 transitions. [2025-01-09 15:55:04,314 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1043 transitions. Word has length 136 [2025-01-09 15:55:04,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:55:04,314 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 1043 transitions. [2025-01-09 15:55:04,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:55:04,314 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1043 transitions. [2025-01-09 15:55:04,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 15:55:04,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:55:04,316 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:55:04,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 15:55:04,316 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:55:04,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:55:04,317 INFO L85 PathProgramCache]: Analyzing trace with hash 2121646992, now seen corresponding path program 1 times [2025-01-09 15:55:04,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:55:04,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964549932] [2025-01-09 15:55:04,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:55:04,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:55:04,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 15:55:04,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 15:55:04,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:55:04,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:55:04,574 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:55:04,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:55:04,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964549932] [2025-01-09 15:55:04,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964549932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:55:04,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:55:04,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:55:04,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887893150] [2025-01-09 15:55:04,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:55:04,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:55:04,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:55:04,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:55:04,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:55:04,576 INFO L87 Difference]: Start difference. First operand 770 states and 1043 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:04,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:55:04,904 INFO L93 Difference]: Finished difference Result 1225 states and 1658 transitions. [2025-01-09 15:55:04,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:55:04,905 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 138 [2025-01-09 15:55:04,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:55:04,908 INFO L225 Difference]: With dead ends: 1225 [2025-01-09 15:55:04,908 INFO L226 Difference]: Without dead ends: 768 [2025-01-09 15:55:04,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:55:04,910 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 212 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:55:04,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 676 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:55:04,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-01-09 15:55:04,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 762. [2025-01-09 15:55:04,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 644 states have (on average 1.2872670807453417) internal successors, (829), 647 states have internal predecessors, (829), 100 states have call successors, (100), 17 states have call predecessors, (100), 17 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 15:55:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 1029 transitions. [2025-01-09 15:55:04,941 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 1029 transitions. Word has length 138 [2025-01-09 15:55:04,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:55:04,942 INFO L471 AbstractCegarLoop]: Abstraction has 762 states and 1029 transitions. [2025-01-09 15:55:04,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 1029 transitions. [2025-01-09 15:55:04,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 15:55:04,943 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:55:04,943 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:55:04,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 15:55:04,943 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:55:04,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:55:04,944 INFO L85 PathProgramCache]: Analyzing trace with hash 315254246, now seen corresponding path program 1 times [2025-01-09 15:55:04,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:55:04,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657461876] [2025-01-09 15:55:04,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:55:04,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:55:04,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 15:55:04,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 15:55:04,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:55:04,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:55:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-01-09 15:55:05,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:55:05,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657461876] [2025-01-09 15:55:05,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657461876] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:55:05,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91631279] [2025-01-09 15:55:05,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:55:05,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:55:05,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:55:05,070 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 15:55:05,072 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 15:55:05,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 15:55:05,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 15:55:05,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:55:05,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:55:05,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:55:05,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:55:05,353 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:55:05,353 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:55:05,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91631279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:55:05,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:55:05,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-01-09 15:55:05,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810383024] [2025-01-09 15:55:05,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:55:05,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:55:05,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:55:05,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:55:05,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:55:05,354 INFO L87 Difference]: Start difference. First operand 762 states and 1029 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:05,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:55:05,413 INFO L93 Difference]: Finished difference Result 1553 states and 2095 transitions. [2025-01-09 15:55:05,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:55:05,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2025-01-09 15:55:05,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:55:05,416 INFO L225 Difference]: With dead ends: 1553 [2025-01-09 15:55:05,416 INFO L226 Difference]: Without dead ends: 794 [2025-01-09 15:55:05,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:55:05,418 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:55:05,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 716 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:55:05,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2025-01-09 15:55:05,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 794. [2025-01-09 15:55:05,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 676 states have (on average 1.2736686390532543) internal successors, (861), 679 states have internal predecessors, (861), 100 states have call successors, (100), 17 states have call predecessors, (100), 17 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 15:55:05,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1061 transitions. [2025-01-09 15:55:05,458 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1061 transitions. Word has length 139 [2025-01-09 15:55:05,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:55:05,459 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1061 transitions. [2025-01-09 15:55:05,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:05,459 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1061 transitions. [2025-01-09 15:55:05,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 15:55:05,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:55:05,460 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:55:05,468 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 15:55:05,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:55:05,660 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:55:05,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:55:05,661 INFO L85 PathProgramCache]: Analyzing trace with hash 204149940, now seen corresponding path program 1 times [2025-01-09 15:55:05,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:55:05,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793085302] [2025-01-09 15:55:05,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:55:05,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:55:05,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 15:55:05,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 15:55:05,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:55:05,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:55:05,715 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:55:05,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:55:05,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793085302] [2025-01-09 15:55:05,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793085302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:55:05,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:55:05,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:55:05,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898474166] [2025-01-09 15:55:05,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:55:05,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:55:05,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:55:05,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:55:05,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:55:05,717 INFO L87 Difference]: Start difference. First operand 794 states and 1061 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:05,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:55:05,755 INFO L93 Difference]: Finished difference Result 1569 states and 2095 transitions. [2025-01-09 15:55:05,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:55:05,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 139 [2025-01-09 15:55:05,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:55:05,759 INFO L225 Difference]: With dead ends: 1569 [2025-01-09 15:55:05,759 INFO L226 Difference]: Without dead ends: 778 [2025-01-09 15:55:05,760 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 15:55:05,760 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:55:05,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:55:05,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2025-01-09 15:55:05,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 778. [2025-01-09 15:55:05,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 660 states have (on average 1.256060606060606) internal successors, (829), 663 states have internal predecessors, (829), 100 states have call successors, (100), 17 states have call predecessors, (100), 17 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2025-01-09 15:55:05,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1029 transitions. [2025-01-09 15:55:05,798 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1029 transitions. Word has length 139 [2025-01-09 15:55:05,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:55:05,798 INFO L471 AbstractCegarLoop]: Abstraction has 778 states and 1029 transitions. [2025-01-09 15:55:05,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:05,799 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1029 transitions. [2025-01-09 15:55:05,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 15:55:05,799 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:55:05,799 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:55:05,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 15:55:05,800 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:55:05,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:55:05,800 INFO L85 PathProgramCache]: Analyzing trace with hash 924449473, now seen corresponding path program 1 times [2025-01-09 15:55:05,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:55:05,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465631854] [2025-01-09 15:55:05,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:55:05,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:55:05,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 15:55:05,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 15:55:05,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:55:05,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:55:06,065 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:55:06,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:55:06,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465631854] [2025-01-09 15:55:06,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465631854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:55:06,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:55:06,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:55:06,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882991902] [2025-01-09 15:55:06,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:55:06,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:55:06,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:55:06,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:55:06,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:55:06,067 INFO L87 Difference]: Start difference. First operand 778 states and 1029 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:06,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:55:06,583 INFO L93 Difference]: Finished difference Result 1520 states and 1978 transitions. [2025-01-09 15:55:06,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:55:06,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 141 [2025-01-09 15:55:06,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:55:06,587 INFO L225 Difference]: With dead ends: 1520 [2025-01-09 15:55:06,587 INFO L226 Difference]: Without dead ends: 1024 [2025-01-09 15:55:06,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:55:06,588 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 196 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:55:06,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 645 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:55:06,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2025-01-09 15:55:06,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1016. [2025-01-09 15:55:06,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 854 states have (on average 1.221311475409836) internal successors, (1043), 862 states have internal predecessors, (1043), 133 states have call successors, (133), 28 states have call predecessors, (133), 28 states have return successors, (133), 125 states have call predecessors, (133), 133 states have call successors, (133) [2025-01-09 15:55:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1309 transitions. [2025-01-09 15:55:06,632 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1309 transitions. Word has length 141 [2025-01-09 15:55:06,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:55:06,632 INFO L471 AbstractCegarLoop]: Abstraction has 1016 states and 1309 transitions. [2025-01-09 15:55:06,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:06,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1309 transitions. [2025-01-09 15:55:06,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 15:55:06,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:55:06,633 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:55:06,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 15:55:06,634 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:55:06,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:55:06,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1199209087, now seen corresponding path program 1 times [2025-01-09 15:55:06,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:55:06,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402488947] [2025-01-09 15:55:06,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:55:06,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:55:06,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 15:55:06,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 15:55:06,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:55:06,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:55:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:55:07,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:55:07,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402488947] [2025-01-09 15:55:07,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402488947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:55:07,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:55:07,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:55:07,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733240737] [2025-01-09 15:55:07,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:55:07,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:55:07,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:55:07,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:55:07,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:55:07,385 INFO L87 Difference]: Start difference. First operand 1016 states and 1309 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:07,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:55:07,977 INFO L93 Difference]: Finished difference Result 2173 states and 2785 transitions. [2025-01-09 15:55:07,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:55:07,977 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 141 [2025-01-09 15:55:07,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:55:07,985 INFO L225 Difference]: With dead ends: 2173 [2025-01-09 15:55:07,985 INFO L226 Difference]: Without dead ends: 1160 [2025-01-09 15:55:07,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:55:07,987 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 153 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:55:07,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 644 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:55:07,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2025-01-09 15:55:08,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1154. [2025-01-09 15:55:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 967 states have (on average 1.2078593588417788) internal successors, (1168), 978 states have internal predecessors, (1168), 152 states have call successors, (152), 34 states have call predecessors, (152), 34 states have return successors, (152), 141 states have call predecessors, (152), 152 states have call successors, (152) [2025-01-09 15:55:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1472 transitions. [2025-01-09 15:55:08,071 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1472 transitions. Word has length 141 [2025-01-09 15:55:08,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:55:08,072 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1472 transitions. [2025-01-09 15:55:08,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:08,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1472 transitions. [2025-01-09 15:55:08,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 15:55:08,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:55:08,073 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:55:08,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 15:55:08,073 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:55:08,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:55:08,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1561256343, now seen corresponding path program 1 times [2025-01-09 15:55:08,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:55:08,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243020949] [2025-01-09 15:55:08,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:55:08,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:55:08,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 15:55:08,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 15:55:08,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:55:08,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:55:08,219 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:55:08,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:55:08,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243020949] [2025-01-09 15:55:08,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243020949] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:55:08,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:55:08,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:55:08,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156841921] [2025-01-09 15:55:08,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:55:08,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:55:08,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:55:08,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:55:08,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:55:08,221 INFO L87 Difference]: Start difference. First operand 1154 states and 1472 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:08,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:55:08,367 INFO L93 Difference]: Finished difference Result 2465 states and 3133 transitions. [2025-01-09 15:55:08,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:55:08,368 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 142 [2025-01-09 15:55:08,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:55:08,372 INFO L225 Difference]: With dead ends: 2465 [2025-01-09 15:55:08,372 INFO L226 Difference]: Without dead ends: 1314 [2025-01-09 15:55:08,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:55:08,374 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 61 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:55:08,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 342 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:55:08,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2025-01-09 15:55:08,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1202. [2025-01-09 15:55:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1202 states, 1015 states have (on average 1.188177339901478) internal successors, (1206), 1026 states have internal predecessors, (1206), 152 states have call successors, (152), 34 states have call predecessors, (152), 34 states have return successors, (152), 141 states have call predecessors, (152), 152 states have call successors, (152) [2025-01-09 15:55:08,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1510 transitions. [2025-01-09 15:55:08,424 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1510 transitions. Word has length 142 [2025-01-09 15:55:08,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:55:08,425 INFO L471 AbstractCegarLoop]: Abstraction has 1202 states and 1510 transitions. [2025-01-09 15:55:08,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:08,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1510 transitions. [2025-01-09 15:55:08,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 15:55:08,426 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:55:08,426 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:55:08,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 15:55:08,426 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:55:08,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:55:08,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1722593703, now seen corresponding path program 1 times [2025-01-09 15:55:08,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:55:08,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732617267] [2025-01-09 15:55:08,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:55:08,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:55:08,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 15:55:08,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 15:55:08,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:55:08,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:55:08,719 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:55:08,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:55:08,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732617267] [2025-01-09 15:55:08,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732617267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:55:08,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:55:08,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:55:08,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673293578] [2025-01-09 15:55:08,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:55:08,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:55:08,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:55:08,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:55:08,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:55:08,720 INFO L87 Difference]: Start difference. First operand 1202 states and 1510 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:09,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:55:09,054 INFO L93 Difference]: Finished difference Result 1245 states and 1562 transitions. [2025-01-09 15:55:09,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:55:09,055 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 142 [2025-01-09 15:55:09,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:55:09,059 INFO L225 Difference]: With dead ends: 1245 [2025-01-09 15:55:09,059 INFO L226 Difference]: Without dead ends: 1243 [2025-01-09 15:55:09,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:55:09,060 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 109 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:55:09,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1000 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:55:09,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2025-01-09 15:55:09,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1241. [2025-01-09 15:55:09,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 1054 states have (on average 1.1764705882352942) internal successors, (1240), 1065 states have internal predecessors, (1240), 152 states have call successors, (152), 34 states have call predecessors, (152), 34 states have return successors, (152), 141 states have call predecessors, (152), 152 states have call successors, (152) [2025-01-09 15:55:09,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1544 transitions. [2025-01-09 15:55:09,108 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1544 transitions. Word has length 142 [2025-01-09 15:55:09,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:55:09,108 INFO L471 AbstractCegarLoop]: Abstraction has 1241 states and 1544 transitions. [2025-01-09 15:55:09,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:09,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1544 transitions. [2025-01-09 15:55:09,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 15:55:09,109 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:55:09,109 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:55:09,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 15:55:09,109 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:55:09,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:55:09,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1650207145, now seen corresponding path program 1 times [2025-01-09 15:55:09,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:55:09,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026571012] [2025-01-09 15:55:09,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:55:09,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:55:09,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 15:55:09,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 15:55:09,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:55:09,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:55:09,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1997840284] [2025-01-09 15:55:09,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:55:09,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:55:09,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:55:09,152 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 15:55:09,154 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 15:55:09,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 15:55:09,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 15:55:09,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:55:09,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:55:09,626 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:55:09,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 15:55:09,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 15:55:09,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:55:09,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:55:10,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:55:10,021 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:55:10,021 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:55:10,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 15:55:10,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:55:10,226 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 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 15:55:10,306 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:55:10,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:55:10 BoogieIcfgContainer [2025-01-09 15:55:10,334 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:55:10,334 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:55:10,336 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:55:10,336 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:55:10,337 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:54:42" (3/4) ... [2025-01-09 15:55:10,338 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:55:10,339 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:55:10,339 INFO L158 Benchmark]: Toolchain (without parser) took 28684.62ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 133.0MB in the beginning and 142.2MB in the end (delta: -9.2MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2025-01-09 15:55:10,339 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:55:10,339 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.60ms. Allocated memory is still 167.8MB. Free memory was 133.0MB in the beginning and 117.1MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:55:10,339 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.95ms. Allocated memory is still 167.8MB. Free memory was 117.1MB in the beginning and 113.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:55:10,340 INFO L158 Benchmark]: Boogie Preprocessor took 58.51ms. Allocated memory is still 167.8MB. Free memory was 113.4MB in the beginning and 110.5MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:55:10,342 INFO L158 Benchmark]: RCFGBuilder took 585.16ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 79.0MB in the end (delta: 31.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 15:55:10,342 INFO L158 Benchmark]: TraceAbstraction took 27722.28ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 78.6MB in the beginning and 142.5MB in the end (delta: -64.0MB). Peak memory consumption was 228.9MB. Max. memory is 16.1GB. [2025-01-09 15:55:10,342 INFO L158 Benchmark]: Witness Printer took 4.21ms. Allocated memory is still 201.3MB. Free memory was 142.5MB in the beginning and 142.2MB in the end (delta: 281.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:55:10,344 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 127.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.60ms. Allocated memory is still 167.8MB. Free memory was 133.0MB in the beginning and 117.1MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.95ms. Allocated memory is still 167.8MB. Free memory was 117.1MB in the beginning and 113.4MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.51ms. Allocated memory is still 167.8MB. Free memory was 113.4MB in the beginning and 110.5MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 585.16ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 79.0MB in the end (delta: 31.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 27722.28ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 78.6MB in the beginning and 142.5MB in the end (delta: -64.0MB). Peak memory consumption was 228.9MB. Max. memory is 16.1GB. * Witness Printer took 4.21ms. Allocated memory is still 201.3MB. Free memory was 142.5MB in the beginning and 142.2MB in the end (delta: 281.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 56, overapproximation of someBinaryDOUBLEComparisonOperation at line 56, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 106. Possible FailurePath: [L37] unsigned char isInitial = 0; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 25, 1, 16, 16, 4, 2, 64, 0, 16, 128.4, 50.2, 3.8, 25.1 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L110] isInitial = 1 [L111] FCALL initially() [L113] FCALL updateLastVariables() [L114] CALL updateVariables() [L78] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L79] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L79] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L79] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L80] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L80] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L80] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L81] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ushort() [L82] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L82] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L82] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L83] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L83] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 65535) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L83] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 65535) VAL [WrapperStruct00={4:0}, isInitial=1] [L84] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_6 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_6 != 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L85] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L86] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L86] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L86] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1] [L87] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] WrapperStruct00.var_1_9 = __VERIFIER_nondet_char() [L89] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 63) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] WrapperStruct00.var_1_10 = __VERIFIER_nondet_char() [L92] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 64) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 64) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L95] EXPR WrapperStruct00.var_1_12 [L95] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_12 [L95] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L95] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L97] EXPR WrapperStruct00.var_1_13 [L97] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L97] EXPR WrapperStruct00.var_1_13 [L97] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L99] EXPR WrapperStruct00.var_1_14 [L99] EXPR WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_14 [L99] EXPR WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L99] EXPR (WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] WrapperStruct00.var_1_15 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_15 [L101] EXPR WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_15 [L101] EXPR WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR (WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] RET updateVariables() [L115] CALL step() [L56] EXPR WrapperStruct00.var_1_12 [L56] EXPR WrapperStruct00.var_1_13 [L56] EXPR WrapperStruct00.var_1_14 [L56] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L56] EXPR ((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1] [L56] COND FALSE !(((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) <= (256.625 * ((((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15))))) [L59] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L59] COND FALSE !(WrapperStruct00.var_1_2) [L62] EXPR WrapperStruct00.var_1_1 [L62] (WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6)) [L62] EXPR WrapperStruct00.var_1_11 [L62] EXPR WrapperStruct00.var_1_6 [L62] (WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1] [L62] COND FALSE !((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) [L65] WrapperStruct00.var_1_5 = 5 VAL [WrapperStruct00={4:0}, isInitial=1] [L67] EXPR WrapperStruct00.var_1_11 [L67] unsigned char stepLocal_1 = WrapperStruct00.var_1_11; [L68] EXPR WrapperStruct00.var_1_2 [L68] unsigned char stepLocal_0 = WrapperStruct00.var_1_2; [L69] stepLocal_0 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11) [L69] EXPR WrapperStruct00.var_1_11 [L69] EXPR WrapperStruct00.var_1_11 [L69] stepLocal_0 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=16] [L69] COND TRUE stepLocal_0 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11) [L70] EXPR WrapperStruct00.var_1_9 [L70] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_1=16] [L70] COND FALSE !(stepLocal_1 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5))) [L106] EXPR WrapperStruct00.var_1_1 [L106] EXPR (WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6)) [L106] EXPR WrapperStruct00.var_1_11 [L106] EXPR WrapperStruct00.var_1_6 [L106] EXPR (WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR ((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)) [L106] EXPR WrapperStruct00.var_1_5 [L106] EXPR ((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5))) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)))) && ((WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11)))))) [L106] EXPR WrapperStruct00.var_1_2 [L106] EXPR WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11) [L106] EXPR WrapperStruct00.var_1_11 [L106] EXPR WrapperStruct00.var_1_11 [L106] EXPR WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11))))) [L106] EXPR WrapperStruct00.var_1_11 [L106] EXPR WrapperStruct00.var_1_9 [L106] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)))) && ((WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11)))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)))) && ((WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11))))))) && ((((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) <= (256.625 * ((((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15))))) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) [L106] EXPR WrapperStruct00.var_1_12 [L106] EXPR WrapperStruct00.var_1_13 [L106] EXPR WrapperStruct00.var_1_14 [L106] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR ((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) <= (256.625 * ((((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15))))) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1 [L106] EXPR WrapperStruct00.var_1_11 [L106] EXPR (((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) <= (256.625 * ((((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15))))) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L106] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)))) && ((WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11))))))) && ((((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) <= (256.625 * ((((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15))))) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L106-L107] return (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) : 1) && (((WrapperStruct00.var_1_1 == 16) || (WrapperStruct00.var_1_11 < (10 / WrapperStruct00.var_1_6))) ? (WrapperStruct00.var_1_5 == ((signed char) WrapperStruct00.var_1_7)) : (WrapperStruct00.var_1_5 == ((signed char) 5)))) && ((WrapperStruct00.var_1_2 || (WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_11)) ? ((WrapperStruct00.var_1_11 < ((WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10) - 16)) ? (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_10) > (32)) ? (WrapperStruct00.var_1_10) : (32))))) : 1) : (WrapperStruct00.var_1_8 == ((unsigned short int) ((((WrapperStruct00.var_1_9) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_11))))))) && ((((WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) <= (256.625 * ((((1.875) > (WrapperStruct00.var_1_15)) ? (1.875) : (WrapperStruct00.var_1_15))))) ? (WrapperStruct00.var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.6s, OverallIterations: 30, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3638 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3633 mSDsluCounter, 20262 SdHoareTripleChecker+Invalid, 8.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15289 mSDsCounter, 585 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11330 IncrementalHoareTripleChecker+Invalid, 11915 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 585 mSolverCounterUnsat, 4973 mSDtfsCounter, 11330 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 773 GetRequests, 579 SyntacticMatches, 1 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1316occurred in iteration=18, InterpolantAutomatonStates: 203, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 29 MinimizatonAttempts, 1228 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 4610 NumberOfCodeBlocks, 4610 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 4294 ConstructedInterpolants, 0 QuantifiedInterpolants, 10710 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1399 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 32 InterpolantComputations, 29 PerfectInterpolantSequences, 13328/13440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 15:55:10,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_variablewrapping_wrapper-s_file-13.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 89473bb9a9d665e14d1630d8bffc5e3f1f6a66f5c07cc27a72988faba87a0da5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:55:12,094 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:55:12,158 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:55:12,162 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:55:12,162 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:55:12,189 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:55:12,190 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:55:12,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:55:12,191 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:55:12,191 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:55:12,191 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:55:12,191 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:55:12,192 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:55:12,192 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:55:12,192 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:55:12,192 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:55:12,192 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:55:12,193 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:55:12,193 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:55:12,193 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:55:12,193 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:55:12,193 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:55:12,193 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:55:12,193 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:55:12,193 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:55:12,193 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:55:12,193 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:55:12,193 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:55:12,193 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:55:12,194 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:55:12,194 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:55:12,194 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:55:12,194 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:55:12,194 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:55:12,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:55:12,194 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:55:12,194 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:55:12,194 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:55:12,195 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:55:12,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:55:12,195 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:55:12,195 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:55:12,195 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:55:12,195 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:55:12,195 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:55:12,195 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:55:12,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:55:12,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:55:12,196 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:55:12,196 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:55:12,196 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 -> 89473bb9a9d665e14d1630d8bffc5e3f1f6a66f5c07cc27a72988faba87a0da5 [2025-01-09 15:55:12,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:55:12,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:55:12,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:55:12,438 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:55:12,439 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:55:12,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i [2025-01-09 15:55:13,684 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10c34bae0/247113bd11244ab5a44ff8c8301c9dd0/FLAG51a876199 [2025-01-09 15:55:13,885 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:55:13,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-13.i [2025-01-09 15:55:13,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10c34bae0/247113bd11244ab5a44ff8c8301c9dd0/FLAG51a876199 [2025-01-09 15:55:14,246 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/10c34bae0/247113bd11244ab5a44ff8c8301c9dd0 [2025-01-09 15:55:14,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:55:14,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:55:14,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:55:14,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:55:14,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:55:14,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:55:14" (1/1) ... [2025-01-09 15:55:14,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff92a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:14, skipping insertion in model container [2025-01-09 15:55:14,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:55:14" (1/1) ... [2025-01-09 15:55:14,265 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:55:14,362 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_variablewrapping_wrapper-s_file-13.i[916,929] [2025-01-09 15:55:14,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:55:14,408 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:55:14,416 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_variablewrapping_wrapper-s_file-13.i[916,929] [2025-01-09 15:55:14,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:55:14,484 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:55:14,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:14 WrapperNode [2025-01-09 15:55:14,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:55:14,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:55:14,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:55:14,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:55:14,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:14" (1/1) ... [2025-01-09 15:55:14,507 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:14" (1/1) ... [2025-01-09 15:55:14,543 INFO L138 Inliner]: procedures = 34, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 462 [2025-01-09 15:55:14,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:55:14,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:55:14,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:55:14,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:55:14,553 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:14" (1/1) ... [2025-01-09 15:55:14,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:14" (1/1) ... [2025-01-09 15:55:14,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:14" (1/1) ... [2025-01-09 15:55:14,573 INFO L175 MemorySlicer]: Split 116 memory accesses to 2 slices as follows [2, 114]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 29 writes are split as follows [0, 29]. [2025-01-09 15:55:14,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:14" (1/1) ... [2025-01-09 15:55:14,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:14" (1/1) ... [2025-01-09 15:55:14,601 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:14" (1/1) ... [2025-01-09 15:55:14,602 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:14" (1/1) ... [2025-01-09 15:55:14,607 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:14" (1/1) ... [2025-01-09 15:55:14,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:14" (1/1) ... [2025-01-09 15:55:14,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:14" (1/1) ... [2025-01-09 15:55:14,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:55:14,621 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:55:14,621 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:55:14,621 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:55:14,625 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:14" (1/1) ... [2025-01-09 15:55:14,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:55:14,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:55:14,653 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:55:14,655 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 15:55:14,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:55:14,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 15:55:14,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 15:55:14,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-01-09 15:55:14,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-01-09 15:55:14,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 15:55:14,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 15:55:14,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:55:14,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:55:14,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:55:14,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:55:14,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 15:55:14,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 15:55:14,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-01-09 15:55:14,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-01-09 15:55:14,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-01-09 15:55:14,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-01-09 15:55:14,672 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:55:14,672 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:55:14,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:55:14,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:55:14,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:55:14,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:55:14,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 15:55:14,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 15:55:14,758 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:55:14,760 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:55:23,765 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2025-01-09 15:55:23,766 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:55:23,776 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:55:23,777 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:55:23,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:55:23 BoogieIcfgContainer [2025-01-09 15:55:23,777 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:55:23,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:55:23,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:55:23,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:55:23,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:55:14" (1/3) ... [2025-01-09 15:55:23,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31504a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:55:23, skipping insertion in model container [2025-01-09 15:55:23,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:14" (2/3) ... [2025-01-09 15:55:23,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31504a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:55:23, skipping insertion in model container [2025-01-09 15:55:23,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:55:23" (3/3) ... [2025-01-09 15:55:23,783 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-13.i [2025-01-09 15:55:23,792 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:55:23,793 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-13.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:55:23,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:55:23,839 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;@315749e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:55:23,840 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:55:23,842 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 94 states have internal predecessors, (134), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:55:23,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 15:55:23,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:55:23,850 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:55:23,850 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:55:23,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:55:23,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1341431835, now seen corresponding path program 1 times [2025-01-09 15:55:23,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:55:23,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392728408] [2025-01-09 15:55:23,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:55:23,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:55:23,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:55:23,864 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:55:23,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 15:55:23,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:55:24,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:55:24,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:55:24,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:55:24,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:55:24,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:55:24,336 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-01-09 15:55:24,337 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:55:24,337 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:55:24,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392728408] [2025-01-09 15:55:24,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392728408] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:55:24,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:55:24,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:55:24,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255266619] [2025-01-09 15:55:24,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:55:24,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:55:24,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:55:24,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:55:24,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:55:24,360 INFO L87 Difference]: Start difference. First operand has 111 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 94 states have internal predecessors, (134), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:55:24,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:55:24,381 INFO L93 Difference]: Finished difference Result 216 states and 338 transitions. [2025-01-09 15:55:24,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:55:24,383 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 131 [2025-01-09 15:55:24,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:55:24,387 INFO L225 Difference]: With dead ends: 216 [2025-01-09 15:55:24,387 INFO L226 Difference]: Without dead ends: 108 [2025-01-09 15:55:24,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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 15:55:24,391 INFO L435 NwaCegarLoop]: 159 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, 159 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 15:55:24,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:55:24,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-01-09 15:55:24,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-01-09 15:55:24,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:55:24,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 159 transitions. [2025-01-09 15:55:24,428 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 159 transitions. Word has length 131 [2025-01-09 15:55:24,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:55:24,429 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 159 transitions. [2025-01-09 15:55:24,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:55:24,430 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 159 transitions. [2025-01-09 15:55:24,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 15:55:24,433 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:55:24,433 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:55:24,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 15:55:24,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:55:24,634 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:55:24,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:55:24,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1703635727, now seen corresponding path program 1 times [2025-01-09 15:55:24,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:55:24,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700214906] [2025-01-09 15:55:24,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:55:24,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:55:24,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:55:24,638 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:55:24,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 15:55:24,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:55:25,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:55:25,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:55:25,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:55:25,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:55:25,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:55:25,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-01-09 15:55:25,377 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:55:25,378 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:55:25,378 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:55:25,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700214906] [2025-01-09 15:55:25,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700214906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:55:25,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:55:25,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:55:25,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217243205] [2025-01-09 15:55:25,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:55:25,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:55:25,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:55:25,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:55:25,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:55:25,380 INFO L87 Difference]: Start difference. First operand 108 states and 159 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:28,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:55:32,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:55:36,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:55:40,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:55:40,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:55:40,925 INFO L93 Difference]: Finished difference Result 250 states and 369 transitions. [2025-01-09 15:55:40,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:55:40,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-01-09 15:55:40,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:55:40,946 INFO L225 Difference]: With dead ends: 250 [2025-01-09 15:55:40,947 INFO L226 Difference]: Without dead ends: 145 [2025-01-09 15:55:40,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:55:40,947 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 50 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:55:40,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 539 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 207 Invalid, 1 Unknown, 0 Unchecked, 15.4s Time] [2025-01-09 15:55:40,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-01-09 15:55:40,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 114. [2025-01-09 15:55:40,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 97 states have (on average 1.4123711340206186) internal successors, (137), 97 states have internal predecessors, (137), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:55:40,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 167 transitions. [2025-01-09 15:55:40,956 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 167 transitions. Word has length 131 [2025-01-09 15:55:40,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:55:40,957 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 167 transitions. [2025-01-09 15:55:40,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:40,958 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 167 transitions. [2025-01-09 15:55:40,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 15:55:40,959 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:55:40,959 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:55:40,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 15:55:41,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:55:41,160 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:55:41,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:55:41,160 INFO L85 PathProgramCache]: Analyzing trace with hash 423772049, now seen corresponding path program 1 times [2025-01-09 15:55:41,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:55:41,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672063283] [2025-01-09 15:55:41,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:55:41,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:55:41,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:55:41,163 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:55:41,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 15:55:41,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 15:55:41,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 15:55:41,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:55:41,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:55:41,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:55:41,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:55:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-01-09 15:55:41,618 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:55:41,618 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:55:41,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672063283] [2025-01-09 15:55:41,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672063283] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:55:41,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:55:41,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:55:41,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297815620] [2025-01-09 15:55:41,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:55:41,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:55:41,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:55:41,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:55:41,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:55:41,619 INFO L87 Difference]: Start difference. First operand 114 states and 167 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:41,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:55:41,668 INFO L93 Difference]: Finished difference Result 227 states and 334 transitions. [2025-01-09 15:55:41,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:55:41,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 131 [2025-01-09 15:55:41,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:55:41,669 INFO L225 Difference]: With dead ends: 227 [2025-01-09 15:55:41,669 INFO L226 Difference]: Without dead ends: 116 [2025-01-09 15:55:41,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:55:41,670 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:55:41,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 460 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:55:41,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-09 15:55:41,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-01-09 15:55:41,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.404040404040404) internal successors, (139), 99 states have internal predecessors, (139), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:55:41,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 169 transitions. [2025-01-09 15:55:41,676 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 169 transitions. Word has length 131 [2025-01-09 15:55:41,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:55:41,676 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 169 transitions. [2025-01-09 15:55:41,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-01-09 15:55:41,677 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 169 transitions. [2025-01-09 15:55:41,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 15:55:41,678 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:55:41,678 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:55:41,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-01-09 15:55:41,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:55:41,878 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:55:41,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:55:41,879 INFO L85 PathProgramCache]: Analyzing trace with hash 141702570, now seen corresponding path program 1 times [2025-01-09 15:55:41,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:55:41,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50964427] [2025-01-09 15:55:41,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:55:41,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:55:41,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:55:41,881 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:55:41,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 15:55:41,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 15:55:42,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 15:55:42,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:55:42,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:55:42,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:55:42,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:55:42,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:55:42,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-01-09 15:55:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-01-09 15:55:42,713 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:55:42,714 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:55:42,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [50964427] [2025-01-09 15:55:42,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [50964427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:55:42,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:55:42,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:55:42,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312833304] [2025-01-09 15:55:42,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:55:42,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:55:42,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:55:42,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:55:42,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:55:42,715 INFO L87 Difference]: Start difference. First operand 116 states and 169 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:55:45,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:55:48,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:55:52,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:55:55,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 15:55:55,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:55:55,645 INFO L93 Difference]: Finished difference Result 230 states and 336 transitions. [2025-01-09 15:55:55,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:55:55,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 133 [2025-01-09 15:55:55,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:55:55,667 INFO L225 Difference]: With dead ends: 230 [2025-01-09 15:55:55,667 INFO L226 Difference]: Without dead ends: 117 [2025-01-09 15:55:55,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:55:55,668 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 118 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:55:55,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 444 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 12.9s Time] [2025-01-09 15:55:55,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-09 15:55:55,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2025-01-09 15:55:55,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.393939393939394) internal successors, (138), 99 states have internal predecessors, (138), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-01-09 15:55:55,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2025-01-09 15:55:55,678 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 133 [2025-01-09 15:55:55,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:55:55,678 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2025-01-09 15:55:55,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:55:55,678 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2025-01-09 15:55:55,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 15:55:55,680 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:55:55,680 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:55:55,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-01-09 15:55:55,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:55:55,883 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:55:55,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:55:55,883 INFO L85 PathProgramCache]: Analyzing trace with hash -971937404, now seen corresponding path program 1 times [2025-01-09 15:55:55,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:55:55,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [799487020] [2025-01-09 15:55:55,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:55:55,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:55:55,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:55:55,886 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:55:55,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 15:55:55,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 15:55:56,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 15:55:56,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:55:56,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:55:56,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:55:56,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:55:56,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:55:56,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-01-09 15:55:56,763 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-01-09 15:55:56,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:55:56,763 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:55:56,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [799487020] [2025-01-09 15:55:56,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [799487020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:55:56,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:55:56,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:55:56,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98308209] [2025-01-09 15:55:56,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:55:56,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:55:56,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:55:56,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:55:56,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:55:56,764 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 15:56:00,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 15:56:04,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []