./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-24.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 27f1e743425525541ce4822cf6e51a4737fceae5e241bd8bfab81b1f43b03433 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:37:24,834 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:37:24,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:37:24,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:37:24,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:37:24,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:37:24,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:37:24,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:37:24,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:37:24,915 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:37:24,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:37:24,916 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:37:24,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:37:24,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:37:24,917 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:37:24,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:37:24,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:37:24,917 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:37:24,917 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:37:24,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:37:24,917 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:37:24,917 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:37:24,917 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:37:24,917 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:37:24,918 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:37:24,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:37:24,918 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:37:24,918 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:37:24,918 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:37:24,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:37:24,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:37:24,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:37:24,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:37:24,919 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:37:24,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:37:24,919 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:37:24,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:37:24,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:37:24,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:37:24,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:37:24,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:37:24,919 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:37:24,919 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:37:24,919 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/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 -> 27f1e743425525541ce4822cf6e51a4737fceae5e241bd8bfab81b1f43b03433 [2025-03-04 01:37:25,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:37:25,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:37:25,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:37:25,149 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:37:25,149 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:37:25,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-24.i [2025-03-04 01:37:26,278 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd2d7c0c8/79a5389b3b1046feace506c7a7078032/FLAG718850e3f [2025-03-04 01:37:26,515 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:37:26,515 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-24.i [2025-03-04 01:37:26,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd2d7c0c8/79a5389b3b1046feace506c7a7078032/FLAG718850e3f [2025-03-04 01:37:26,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd2d7c0c8/79a5389b3b1046feace506c7a7078032 [2025-03-04 01:37:26,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:37:26,853 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:37:26,854 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:37:26,854 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:37:26,857 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:37:26,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:37:26" (1/1) ... [2025-03-04 01:37:26,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47abc21b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:26, skipping insertion in model container [2025-03-04 01:37:26,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:37:26" (1/1) ... [2025-03-04 01:37:26,874 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:37:26,979 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-24.i[916,929] [2025-03-04 01:37:27,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:37:27,045 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:37:27,053 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-24.i[916,929] [2025-03-04 01:37:27,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:37:27,108 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:37:27,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:27 WrapperNode [2025-03-04 01:37:27,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:37:27,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:37:27,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:37:27,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:37:27,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:27" (1/1) ... [2025-03-04 01:37:27,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:27" (1/1) ... [2025-03-04 01:37:27,161 INFO L138 Inliner]: procedures = 30, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 454 [2025-03-04 01:37:27,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:37:27,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:37:27,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:37:27,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:37:27,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:27" (1/1) ... [2025-03-04 01:37:27,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:27" (1/1) ... [2025-03-04 01:37:27,176 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:27" (1/1) ... [2025-03-04 01:37:27,185 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:37:27,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:27" (1/1) ... [2025-03-04 01:37:27,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:27" (1/1) ... [2025-03-04 01:37:27,208 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:27" (1/1) ... [2025-03-04 01:37:27,212 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:27" (1/1) ... [2025-03-04 01:37:27,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:27" (1/1) ... [2025-03-04 01:37:27,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:27" (1/1) ... [2025-03-04 01:37:27,216 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:37:27,217 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:37:27,217 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:37:27,217 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:37:27,218 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:27" (1/1) ... [2025-03-04 01:37:27,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:37:27,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:37:27,250 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:37:27,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:37:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:37:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:37:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:37:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:37:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:37:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:37:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:37:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:37:27,272 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:37:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:37:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:37:27,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:37:27,354 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:37:27,355 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:37:27,737 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc property_#t~mem73#1;havoc property_#t~mem72#1;havoc property_#t~short74#1;havoc property_#t~ite96#1;havoc property_#t~mem75#1;havoc property_#t~ite93#1;havoc property_#t~mem78#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem92#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite83#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~mem84#1;havoc property_#t~ite91#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~mem90#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~ite111#1;havoc property_#t~mem110#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem105#1;havoc property_#t~ite109#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~mem108#1;havoc property_#t~short112#1;havoc property_#t~mem113#1;havoc property_#t~ite118#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~short119#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short122#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~short125#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~short128#1; [2025-03-04 01:37:27,782 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2025-03-04 01:37:27,783 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:37:27,791 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:37:27,792 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:37:27,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:37:27 BoogieIcfgContainer [2025-03-04 01:37:27,792 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:37:27,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:37:27,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:37:27,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:37:27,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:37:26" (1/3) ... [2025-03-04 01:37:27,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eba53b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:37:27, skipping insertion in model container [2025-03-04 01:37:27,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:27" (2/3) ... [2025-03-04 01:37:27,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eba53b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:37:27, skipping insertion in model container [2025-03-04 01:37:27,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:37:27" (3/3) ... [2025-03-04 01:37:27,799 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-24.i [2025-03-04 01:37:27,809 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:37:27,810 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-24.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:37:27,852 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:37:27,860 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;@161817b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:37:27,860 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:37:27,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 83 states have internal predecessors, (114), 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-03-04 01:37:27,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:37:27,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:37:27,874 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] [2025-03-04 01:37:27,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:37:27,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:37:27,879 INFO L85 PathProgramCache]: Analyzing trace with hash -503041458, now seen corresponding path program 1 times [2025-03-04 01:37:27,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:37:27,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612759210] [2025-03-04 01:37:27,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:37:27,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:37:27,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:37:28,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:37:28,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:28,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:37:28,201 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-04 01:37:28,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:37:28,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612759210] [2025-03-04 01:37:28,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612759210] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:37:28,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644359207] [2025-03-04 01:37:28,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:37:28,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:37:28,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:37:28,205 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:37:28,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:37:28,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:37:28,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:37:28,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:28,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:37:28,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:37:28,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:37:28,470 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-04 01:37:28,472 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:37:28,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644359207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:37:28,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:37:28,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:37:28,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497559509] [2025-03-04 01:37:28,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:37:28,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:37:28,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:37:28,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:37:28,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:37:28,494 INFO L87 Difference]: Start difference. First operand has 100 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 83 states have internal predecessors, (114), 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 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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-03-04 01:37:28,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:37:28,510 INFO L93 Difference]: Finished difference Result 194 states and 298 transitions. [2025-03-04 01:37:28,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:37:28,511 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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 124 [2025-03-04 01:37:28,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:37:28,515 INFO L225 Difference]: With dead ends: 194 [2025-03-04 01:37:28,515 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 01:37:28,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 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-03-04 01:37:28,519 INFO L435 NwaCegarLoop]: 139 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, 139 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-03-04 01:37:28,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:37:28,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 01:37:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-04 01:37:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 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-03-04 01:37:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2025-03-04 01:37:28,547 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 124 [2025-03-04 01:37:28,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:37:28,547 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2025-03-04 01:37:28,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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-03-04 01:37:28,548 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2025-03-04 01:37:28,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:37:28,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:37:28,549 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] [2025-03-04 01:37:28,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:37:28,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:37:28,754 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:37:28,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:37:28,755 INFO L85 PathProgramCache]: Analyzing trace with hash 981754683, now seen corresponding path program 1 times [2025-03-04 01:37:28,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:37:28,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052610466] [2025-03-04 01:37:28,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:37:28,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:37:28,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:37:28,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:37:28,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:28,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:37:28,954 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:37:28,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:37:28,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052610466] [2025-03-04 01:37:28,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052610466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:37:28,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:37:28,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:37:28,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730670102] [2025-03-04 01:37:28,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:37:28,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:37:28,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:37:28,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:37:28,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:37:28,956 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-03-04 01:37:28,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:37:28,983 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2025-03-04 01:37:28,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:37:28,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 124 [2025-03-04 01:37:28,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:37:28,987 INFO L225 Difference]: With dead ends: 192 [2025-03-04 01:37:28,987 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 01:37:28,988 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-03-04 01:37:28,989 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 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-03-04 01:37:28,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:37:28,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 01:37:28,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-04 01:37:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 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-03-04 01:37:28,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2025-03-04 01:37:29,000 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 124 [2025-03-04 01:37:29,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:37:29,001 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2025-03-04 01:37:29,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-03-04 01:37:29,002 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2025-03-04 01:37:29,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:37:29,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:37:29,003 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] [2025-03-04 01:37:29,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:37:29,003 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:37:29,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:37:29,004 INFO L85 PathProgramCache]: Analyzing trace with hash -263009798, now seen corresponding path program 1 times [2025-03-04 01:37:29,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:37:29,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301405496] [2025-03-04 01:37:29,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:37:29,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:37:29,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:37:29,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:37:29,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:29,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:37:29,247 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:37:29,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:37:29,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301405496] [2025-03-04 01:37:29,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301405496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:37:29,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:37:29,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:37:29,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005674254] [2025-03-04 01:37:29,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:37:29,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:37:29,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:37:29,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:37:29,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:37:29,250 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-03-04 01:37:29,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:37:29,283 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2025-03-04 01:37:29,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:37:29,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 124 [2025-03-04 01:37:29,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:37:29,285 INFO L225 Difference]: With dead ends: 196 [2025-03-04 01:37:29,285 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 01:37:29,285 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-03-04 01:37:29,286 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:37:29,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 397 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:37:29,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 01:37:29,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-03-04 01:37:29,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 83 states have internal predecessors, (112), 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-03-04 01:37:29,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2025-03-04 01:37:29,292 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 124 [2025-03-04 01:37:29,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:37:29,292 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2025-03-04 01:37:29,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-03-04 01:37:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2025-03-04 01:37:29,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:37:29,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:37:29,294 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] [2025-03-04 01:37:29,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:37:29,294 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:37:29,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:37:29,294 INFO L85 PathProgramCache]: Analyzing trace with hash -2070464261, now seen corresponding path program 1 times [2025-03-04 01:37:29,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:37:29,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530588858] [2025-03-04 01:37:29,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:37:29,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:37:29,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:37:29,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:37:29,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:29,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:37:29,447 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:37:29,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:37:29,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530588858] [2025-03-04 01:37:29,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530588858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:37:29,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:37:29,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:37:29,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726983664] [2025-03-04 01:37:29,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:37:29,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:37:29,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:37:29,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:37:29,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:37:29,450 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-03-04 01:37:29,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:37:29,482 INFO L93 Difference]: Finished difference Result 200 states and 285 transitions. [2025-03-04 01:37:29,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:37:29,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 124 [2025-03-04 01:37:29,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:37:29,486 INFO L225 Difference]: With dead ends: 200 [2025-03-04 01:37:29,486 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 01:37:29,487 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-03-04 01:37:29,487 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:37:29,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 398 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:37:29,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 01:37:29,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2025-03-04 01:37:29,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 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-03-04 01:37:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2025-03-04 01:37:29,499 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 124 [2025-03-04 01:37:29,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:37:29,500 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2025-03-04 01:37:29,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-03-04 01:37:29,500 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2025-03-04 01:37:29,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:37:29,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:37:29,504 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] [2025-03-04 01:37:29,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:37:29,504 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:37:29,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:37:29,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1182960580, now seen corresponding path program 1 times [2025-03-04 01:37:29,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:37:29,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86489517] [2025-03-04 01:37:29,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:37:29,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:37:29,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:37:29,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:37:29,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:29,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:37:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:37:29,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:37:29,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86489517] [2025-03-04 01:37:29,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86489517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:37:29,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:37:29,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:37:29,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269425443] [2025-03-04 01:37:29,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:37:29,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:37:29,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:37:29,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:37:29,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:37:29,665 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-03-04 01:37:29,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:37:29,687 INFO L93 Difference]: Finished difference Result 204 states and 289 transitions. [2025-03-04 01:37:29,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:37:29,688 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 124 [2025-03-04 01:37:29,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:37:29,689 INFO L225 Difference]: With dead ends: 204 [2025-03-04 01:37:29,689 INFO L226 Difference]: Without dead ends: 105 [2025-03-04 01:37:29,689 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-03-04 01:37:29,692 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:37:29,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 400 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:37:29,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-04 01:37:29,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2025-03-04 01:37:29,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 87 states have internal predecessors, (116), 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-03-04 01:37:29,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2025-03-04 01:37:29,700 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 124 [2025-03-04 01:37:29,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:37:29,701 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2025-03-04 01:37:29,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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-03-04 01:37:29,701 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2025-03-04 01:37:29,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:37:29,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:37:29,702 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] [2025-03-04 01:37:29,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:37:29,702 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:37:29,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:37:29,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1182037059, now seen corresponding path program 1 times [2025-03-04 01:37:29,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:37:29,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181167724] [2025-03-04 01:37:29,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:37:29,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:37:29,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:37:29,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:37:29,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:29,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:37:30,041 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:37:30,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:37:30,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181167724] [2025-03-04 01:37:30,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181167724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:37:30,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:37:30,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:37:30,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328268075] [2025-03-04 01:37:30,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:37:30,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:37:30,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:37:30,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:37:30,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:37:30,045 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-03-04 01:37:30,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:37:30,312 INFO L93 Difference]: Finished difference Result 264 states and 368 transitions. [2025-03-04 01:37:30,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:37:30,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 124 [2025-03-04 01:37:30,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:37:30,314 INFO L225 Difference]: With dead ends: 264 [2025-03-04 01:37:30,315 INFO L226 Difference]: Without dead ends: 163 [2025-03-04 01:37:30,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-03-04 01:37:30,316 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 63 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:37:30,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 457 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:37:30,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-04 01:37:30,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 160. [2025-03-04 01:37:30,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 140 states have (on average 1.3428571428571427) internal successors, (188), 141 states have internal predecessors, (188), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:37:30,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 222 transitions. [2025-03-04 01:37:30,325 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 222 transitions. Word has length 124 [2025-03-04 01:37:30,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:37:30,326 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 222 transitions. [2025-03-04 01:37:30,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-03-04 01:37:30,326 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 222 transitions. [2025-03-04 01:37:30,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:37:30,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:37:30,327 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] [2025-03-04 01:37:30,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:37:30,327 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:37:30,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:37:30,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1619261601, now seen corresponding path program 1 times [2025-03-04 01:37:30,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:37:30,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793745545] [2025-03-04 01:37:30,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:37:30,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:37:30,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:37:30,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:37:30,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:30,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:37:31,306 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:37:31,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:37:31,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793745545] [2025-03-04 01:37:31,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793745545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:37:31,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:37:31,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:37:31,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794137943] [2025-03-04 01:37:31,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:37:31,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:37:31,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:37:31,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:37:31,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:37:31,309 INFO L87 Difference]: Start difference. First operand 160 states and 222 transitions. Second operand has 7 states, 5 states have (on average 10.6) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 01:37:31,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:37:31,949 INFO L93 Difference]: Finished difference Result 416 states and 582 transitions. [2025-03-04 01:37:31,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:37:31,949 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 10.6) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 125 [2025-03-04 01:37:31,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:37:31,952 INFO L225 Difference]: With dead ends: 416 [2025-03-04 01:37:31,953 INFO L226 Difference]: Without dead ends: 259 [2025-03-04 01:37:31,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:37:31,954 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 110 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:37:31,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 687 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:37:31,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-04 01:37:31,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 177. [2025-03-04 01:37:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 157 states have (on average 1.3503184713375795) internal successors, (212), 158 states have internal predecessors, (212), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:37:31,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 246 transitions. [2025-03-04 01:37:31,967 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 246 transitions. Word has length 125 [2025-03-04 01:37:31,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:37:31,967 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 246 transitions. [2025-03-04 01:37:31,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 10.6) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 01:37:31,967 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 246 transitions. [2025-03-04 01:37:31,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:37:31,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:37:31,968 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] [2025-03-04 01:37:31,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:37:31,969 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:37:31,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:37:31,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1552254848, now seen corresponding path program 1 times [2025-03-04 01:37:31,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:37:31,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303500458] [2025-03-04 01:37:31,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:37:31,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:37:31,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:37:32,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:37:32,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:32,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:37:32,197 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:37:32,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:37:32,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303500458] [2025-03-04 01:37:32,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303500458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:37:32,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:37:32,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:37:32,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575937163] [2025-03-04 01:37:32,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:37:32,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:37:32,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:37:32,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:37:32,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:37:32,199 INFO L87 Difference]: Start difference. First operand 177 states and 246 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-03-04 01:37:32,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:37:32,429 INFO L93 Difference]: Finished difference Result 433 states and 602 transitions. [2025-03-04 01:37:32,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:37:32,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 125 [2025-03-04 01:37:32,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:37:32,430 INFO L225 Difference]: With dead ends: 433 [2025-03-04 01:37:32,431 INFO L226 Difference]: Without dead ends: 259 [2025-03-04 01:37:32,431 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-03-04 01:37:32,431 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 122 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:37:32,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 292 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:37:32,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-04 01:37:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 177. [2025-03-04 01:37:32,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 157 states have (on average 1.3439490445859872) internal successors, (211), 158 states have internal predecessors, (211), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:37:32,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 245 transitions. [2025-03-04 01:37:32,445 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 245 transitions. Word has length 125 [2025-03-04 01:37:32,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:37:32,445 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 245 transitions. [2025-03-04 01:37:32,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-03-04 01:37:32,445 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 245 transitions. [2025-03-04 01:37:32,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 01:37:32,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:37:32,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] [2025-03-04 01:37:32,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:37:32,447 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:37:32,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:37:32,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1870708965, now seen corresponding path program 1 times [2025-03-04 01:37:32,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:37:32,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209371357] [2025-03-04 01:37:32,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:37:32,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:37:32,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 01:37:32,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 01:37:32,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:32,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:37:32,676 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:37:32,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:37:32,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209371357] [2025-03-04 01:37:32,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209371357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:37:32,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:37:32,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:37:32,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430577983] [2025-03-04 01:37:32,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:37:32,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:37:32,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:37:32,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:37:32,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:37:32,681 INFO L87 Difference]: Start difference. First operand 177 states and 245 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-03-04 01:37:32,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:37:32,887 INFO L93 Difference]: Finished difference Result 477 states and 659 transitions. [2025-03-04 01:37:32,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:37:32,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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 126 [2025-03-04 01:37:32,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:37:32,889 INFO L225 Difference]: With dead ends: 477 [2025-03-04 01:37:32,889 INFO L226 Difference]: Without dead ends: 303 [2025-03-04 01:37:32,890 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-03-04 01:37:32,890 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 100 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:37:32,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 356 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:37:32,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-04 01:37:32,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 179. [2025-03-04 01:37:32,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 159 states have (on average 1.3396226415094339) internal successors, (213), 160 states have internal predecessors, (213), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:37:32,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 247 transitions. [2025-03-04 01:37:32,904 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 247 transitions. Word has length 126 [2025-03-04 01:37:32,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:37:32,904 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 247 transitions. [2025-03-04 01:37:32,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-03-04 01:37:32,904 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 247 transitions. [2025-03-04 01:37:32,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 01:37:32,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:37:32,905 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] [2025-03-04 01:37:32,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:37:32,905 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:37:32,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:37:32,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1427185978, now seen corresponding path program 1 times [2025-03-04 01:37:32,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:37:32,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048033267] [2025-03-04 01:37:32,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:37:32,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:37:32,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 01:37:32,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 01:37:32,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:32,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:37:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:37:33,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:37:33,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048033267] [2025-03-04 01:37:33,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048033267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:37:33,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:37:33,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:37:33,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982284794] [2025-03-04 01:37:33,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:37:33,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:37:33,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:37:33,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:37:33,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:37:33,604 INFO L87 Difference]: Start difference. First operand 179 states and 247 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 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-03-04 01:37:33,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:37:33,956 INFO L93 Difference]: Finished difference Result 433 states and 598 transitions. [2025-03-04 01:37:33,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:37:33,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 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 126 [2025-03-04 01:37:33,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:37:33,958 INFO L225 Difference]: With dead ends: 433 [2025-03-04 01:37:33,960 INFO L226 Difference]: Without dead ends: 257 [2025-03-04 01:37:33,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:37:33,961 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 115 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:37:33,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 387 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:37:33,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-03-04 01:37:33,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 177. [2025-03-04 01:37:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 157 states have (on average 1.3248407643312101) internal successors, (208), 158 states have internal predecessors, (208), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:37:33,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 242 transitions. [2025-03-04 01:37:33,969 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 242 transitions. Word has length 126 [2025-03-04 01:37:33,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:37:33,969 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 242 transitions. [2025-03-04 01:37:33,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 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-03-04 01:37:33,970 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 242 transitions. [2025-03-04 01:37:33,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:37:33,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:37:33,971 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] [2025-03-04 01:37:33,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:37:33,971 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:37:33,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:37:33,971 INFO L85 PathProgramCache]: Analyzing trace with hash -2133771172, now seen corresponding path program 1 times [2025-03-04 01:37:33,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:37:33,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176921170] [2025-03-04 01:37:33,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:37:33,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:37:33,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:37:34,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:37:34,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:34,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:37:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:37:35,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:37:35,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176921170] [2025-03-04 01:37:35,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176921170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:37:35,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:37:35,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:37:35,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690188642] [2025-03-04 01:37:35,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:37:35,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:37:35,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:37:35,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:37:35,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:37:35,265 INFO L87 Difference]: Start difference. First operand 177 states and 242 transitions. Second operand has 8 states, 6 states have (on average 9.166666666666666) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 01:37:35,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:37:35,842 INFO L93 Difference]: Finished difference Result 411 states and 559 transitions. [2025-03-04 01:37:35,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:37:35,843 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.166666666666666) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 127 [2025-03-04 01:37:35,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:37:35,844 INFO L225 Difference]: With dead ends: 411 [2025-03-04 01:37:35,845 INFO L226 Difference]: Without dead ends: 237 [2025-03-04 01:37:35,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:37:35,846 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 61 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:37:35,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 878 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:37:35,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-04 01:37:35,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 188. [2025-03-04 01:37:35,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 168 states have (on average 1.3273809523809523) internal successors, (223), 169 states have internal predecessors, (223), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:37:35,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 257 transitions. [2025-03-04 01:37:35,854 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 257 transitions. Word has length 127 [2025-03-04 01:37:35,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:37:35,855 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 257 transitions. [2025-03-04 01:37:35,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.166666666666666) internal successors, (55), 8 states have internal predecessors, (55), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 01:37:35,855 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 257 transitions. [2025-03-04 01:37:35,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:37:35,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:37:35,856 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] [2025-03-04 01:37:35,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:37:35,856 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:37:35,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:37:35,856 INFO L85 PathProgramCache]: Analyzing trace with hash 463849718, now seen corresponding path program 1 times [2025-03-04 01:37:35,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:37:35,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942723480] [2025-03-04 01:37:35,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:37:35,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:37:35,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:37:35,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:37:35,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:35,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:37:35,972 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 01:37:35,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:37:35,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942723480] [2025-03-04 01:37:35,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942723480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:37:35,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101591897] [2025-03-04 01:37:35,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:37:35,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:37:35,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:37:35,975 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:37:35,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:37:36,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:37:36,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:37:36,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:36,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:37:36,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:37:36,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:37:36,188 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:37:36,189 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:37:36,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101591897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:37:36,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:37:36,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:37:36,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933848140] [2025-03-04 01:37:36,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:37:36,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:37:36,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:37:36,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:37:36,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:37:36,191 INFO L87 Difference]: Start difference. First operand 188 states and 257 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-03-04 01:37:36,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:37:36,218 INFO L93 Difference]: Finished difference Result 379 states and 519 transitions. [2025-03-04 01:37:36,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:37:36,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 128 [2025-03-04 01:37:36,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:37:36,220 INFO L225 Difference]: With dead ends: 379 [2025-03-04 01:37:36,220 INFO L226 Difference]: Without dead ends: 194 [2025-03-04 01:37:36,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:37:36,221 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:37:36,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 527 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:37:36,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-04 01:37:36,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-03-04 01:37:36,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 174 states have (on average 1.3160919540229885) internal successors, (229), 175 states have internal predecessors, (229), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:37:36,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 263 transitions. [2025-03-04 01:37:36,236 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 263 transitions. Word has length 128 [2025-03-04 01:37:36,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:37:36,237 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 263 transitions. [2025-03-04 01:37:36,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-03-04 01:37:36,237 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 263 transitions. [2025-03-04 01:37:36,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:37:36,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:37:36,239 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] [2025-03-04 01:37:36,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:37:36,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 01:37:36,443 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:37:36,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:37:36,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1483890308, now seen corresponding path program 1 times [2025-03-04 01:37:36,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:37:36,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485360743] [2025-03-04 01:37:36,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:37:36,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:37:36,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:37:36,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:37:36,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:36,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:37:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 01:37:36,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:37:36,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485360743] [2025-03-04 01:37:36,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485360743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:37:36,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99308461] [2025-03-04 01:37:36,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:37:36,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:37:36,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:37:36,915 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:37:36,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:37:37,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:37:37,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:37:37,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:37,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:37:37,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 01:37:37,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:37:37,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 33 treesize of output 17 [2025-03-04 01:37:37,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 33 treesize of output 17 [2025-03-04 01:37:37,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 33 treesize of output 26 [2025-03-04 01:37:37,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:37:37,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 70 treesize of output 29 [2025-03-04 01:37:37,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:37:37,328 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 38 treesize of output 14 [2025-03-04 01:37:37,346 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 194 proven. 12 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2025-03-04 01:37:37,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:37:37,623 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 01:37:37,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99308461] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:37:37,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:37:37,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 14 [2025-03-04 01:37:37,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176779497] [2025-03-04 01:37:37,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:37:37,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:37:37,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:37:37,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:37:37,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:37:37,624 INFO L87 Difference]: Start difference. First operand 194 states and 263 transitions. Second operand has 14 states, 11 states have (on average 6.909090909090909) internal successors, (76), 14 states have internal predecessors, (76), 5 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-04 01:37:38,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:37:38,745 INFO L93 Difference]: Finished difference Result 507 states and 677 transitions. [2025-03-04 01:37:38,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 01:37:38,746 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 6.909090909090909) internal successors, (76), 14 states have internal predecessors, (76), 5 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 5 states have call successors, (21) Word has length 129 [2025-03-04 01:37:38,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:37:38,748 INFO L225 Difference]: With dead ends: 507 [2025-03-04 01:37:38,748 INFO L226 Difference]: Without dead ends: 316 [2025-03-04 01:37:38,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 251 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=213, Invalid=779, Unknown=0, NotChecked=0, Total=992 [2025-03-04 01:37:38,750 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 353 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:37:38,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 611 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 01:37:38,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-04 01:37:38,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 305. [2025-03-04 01:37:38,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 265 states have (on average 1.2830188679245282) internal successors, (340), 267 states have internal predecessors, (340), 32 states have call successors, (32), 7 states have call predecessors, (32), 7 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:37:38,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 404 transitions. [2025-03-04 01:37:38,767 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 404 transitions. Word has length 129 [2025-03-04 01:37:38,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:37:38,768 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 404 transitions. [2025-03-04 01:37:38,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 6.909090909090909) internal successors, (76), 14 states have internal predecessors, (76), 5 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-04 01:37:38,768 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 404 transitions. [2025-03-04 01:37:38,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:37:38,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:37:38,772 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] [2025-03-04 01:37:38,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 01:37:38,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:37:38,973 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:37:38,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:37:38,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1472574181, now seen corresponding path program 1 times [2025-03-04 01:37:38,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:37:38,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691867825] [2025-03-04 01:37:38,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:37:38,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:37:39,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:37:39,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:37:39,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:39,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:37:39,045 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:37:39,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:37:39,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:37:39,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:37:39,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:37:39,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:37:39,128 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:37:39,129 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:37:39,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:37:39,133 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:37:39,183 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:37:39,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:37:39 BoogieIcfgContainer [2025-03-04 01:37:39,188 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:37:39,189 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:37:39,189 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:37:39,189 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:37:39,190 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:37:27" (3/4) ... [2025-03-04 01:37:39,191 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:37:39,192 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:37:39,192 INFO L158 Benchmark]: Toolchain (without parser) took 12339.26ms. Allocated memory was 201.3MB in the beginning and 377.5MB in the end (delta: 176.2MB). Free memory was 154.7MB in the beginning and 284.9MB in the end (delta: -130.2MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2025-03-04 01:37:39,192 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:37:39,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.69ms. Allocated memory is still 201.3MB. Free memory was 154.7MB in the beginning and 138.5MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:37:39,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.00ms. Allocated memory is still 201.3MB. Free memory was 138.5MB in the beginning and 134.9MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:37:39,193 INFO L158 Benchmark]: Boogie Preprocessor took 54.26ms. Allocated memory is still 201.3MB. Free memory was 134.9MB in the beginning and 131.8MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:37:39,193 INFO L158 Benchmark]: IcfgBuilder took 575.01ms. Allocated memory is still 201.3MB. Free memory was 131.8MB in the beginning and 101.0MB in the end (delta: 30.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 01:37:39,193 INFO L158 Benchmark]: TraceAbstraction took 11394.83ms. Allocated memory was 201.3MB in the beginning and 377.5MB in the end (delta: 176.2MB). Free memory was 100.6MB in the beginning and 285.0MB in the end (delta: -184.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:37:39,193 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 377.5MB. Free memory was 285.0MB in the beginning and 284.9MB in the end (delta: 119.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:37:39,194 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.31ms. Allocated memory is still 201.3MB. Free memory is still 118.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.69ms. Allocated memory is still 201.3MB. Free memory was 154.7MB in the beginning and 138.5MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.00ms. Allocated memory is still 201.3MB. Free memory was 138.5MB in the beginning and 134.9MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.26ms. Allocated memory is still 201.3MB. Free memory was 134.9MB in the beginning and 131.8MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 575.01ms. Allocated memory is still 201.3MB. Free memory was 131.8MB in the beginning and 101.0MB in the end (delta: 30.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11394.83ms. Allocated memory was 201.3MB in the beginning and 377.5MB in the end (delta: 176.2MB). Free memory was 100.6MB in the beginning and 285.0MB in the end (delta: -184.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 377.5MB. Free memory was 285.0MB in the beginning and 284.9MB in the end (delta: 119.9kB). There was no memory consumed. 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 someBinaryArithmeticDOUBLEoperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 75. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 0, 16, 4, 0, 0, 55182, 0, 1, 1, 100, 2.25, 199.4, -128 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] FCALL updateLastVariables() [L115] CALL updateVariables() [L80] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L81] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L81] 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] [L81] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L82] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L82] 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] [L82] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L83] WrapperStruct00.var_1_4 = __VERIFIER_nondet_char() [L84] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -1) 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_4 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1] [L85] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L86] WrapperStruct00.var_1_5 = __VERIFIER_nondet_char() [L87] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) 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_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] WrapperStruct00.var_1_6 = __VERIFIER_nondet_char() [L90] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= -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_6 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] WrapperStruct00.var_1_10 = __VERIFIER_nondet_ushort() [L93] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 32767) 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 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) 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_14 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) 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_15 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] WrapperStruct00.var_1_18 = __VERIFIER_nondet_float() [L102] EXPR WrapperStruct00.var_1_18 [L102] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_18 [L102] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR (WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 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] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] RET updateVariables() [L116] CALL step() [L58] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L58] COND FALSE !(! WrapperStruct00.var_1_2) [L61] EXPR WrapperStruct00.var_1_15 [L61] WrapperStruct00.var_1_12 = ((! WrapperStruct00.var_1_15) || (! (! 0))) [L63] EXPR WrapperStruct00.var_1_5 [L63] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_5 [L64] EXPR WrapperStruct00.var_1_18 [L64] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_18 [L65] EXPR WrapperStruct00.var_1_4 [L65] WrapperStruct00.var_1_19 = WrapperStruct00.var_1_4 [L66] EXPR WrapperStruct00.var_1_12 [L66] WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17) [L66] EXPR WrapperStruct00.var_1_17 [L66] WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17) VAL [WrapperStruct00={4:0}, isInitial=1] [L66] COND TRUE WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17) [L67] WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L67] COND FALSE !(WrapperStruct00.var_1_12) [L70] EXPR WrapperStruct00.var_1_4 [L70] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L70] EXPR ((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5) [L70] EXPR WrapperStruct00.var_1_4 [L70] EXPR ((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5) VAL [WrapperStruct00={4:0}, isInitial=1] [L70] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L70] EXPR ((((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) < (WrapperStruct00.var_1_6)) ? (((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_6) [L70] EXPR WrapperStruct00.var_1_6 [L70] EXPR ((((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) < (WrapperStruct00.var_1_6)) ? (((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_6) VAL [WrapperStruct00={4:0}, isInitial=1] [L70] WrapperStruct00.var_1_1 = ((((((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) < (WrapperStruct00.var_1_6)) ? (((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_6))) [L75] EXPR WrapperStruct00.var_1_17 [L75] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1] [L75] EXPR (((WrapperStruct00.var_1_17 * 127.75)) > ((WrapperStruct00.var_1_17 / 3.4))) ? ((WrapperStruct00.var_1_17 * 127.75)) : ((WrapperStruct00.var_1_17 / 3.4)) [L75] EXPR WrapperStruct00.var_1_17 [L75] EXPR (((WrapperStruct00.var_1_17 * 127.75)) > ((WrapperStruct00.var_1_17 / 3.4))) ? ((WrapperStruct00.var_1_17 * 127.75)) : ((WrapperStruct00.var_1_17 / 3.4)) VAL [WrapperStruct00={4:0}, isInitial=1] [L75] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1] [L75] COND FALSE !((((((WrapperStruct00.var_1_17 * 127.75)) > ((WrapperStruct00.var_1_17 / 3.4))) ? ((WrapperStruct00.var_1_17 * 127.75)) : ((WrapperStruct00.var_1_17 / 3.4)))) >= WrapperStruct00.var_1_17) [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR WrapperStruct00.var_1_12 [L107] EXPR WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17) [L107] EXPR WrapperStruct00.var_1_17 [L107] EXPR WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR (WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_1 == ((signed char) ((((((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) < (WrapperStruct00.var_1_6)) ? (((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_4)) [L107] EXPR WrapperStruct00.var_1_1 [L107] EXPR WrapperStruct00.var_1_4 [L107] EXPR (WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_1 == ((signed char) ((((((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) < (WrapperStruct00.var_1_6)) ? (((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_4)) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR ((WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_1 == ((signed char) ((((((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) < (WrapperStruct00.var_1_6)) ? (((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_4))) && (((((((WrapperStruct00.var_1_17 * 127.75)) > ((WrapperStruct00.var_1_17 / 3.4))) ? ((WrapperStruct00.var_1_17 * 127.75)) : ((WrapperStruct00.var_1_17 / 3.4)))) >= WrapperStruct00.var_1_17) ? (WrapperStruct00.var_1_7 == ((unsigned short int) (((((WrapperStruct00.var_1_10 - (22925 - WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_16)) ? ((WrapperStruct00.var_1_10 - (22925 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_16))))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR (((WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_1 == ((signed char) ((((((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) < (WrapperStruct00.var_1_6)) ? (((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_4))) && (((((((WrapperStruct00.var_1_17 * 127.75)) > ((WrapperStruct00.var_1_17 / 3.4))) ? ((WrapperStruct00.var_1_17 * 127.75)) : ((WrapperStruct00.var_1_17 / 3.4)))) >= WrapperStruct00.var_1_17) ? (WrapperStruct00.var_1_7 == ((unsigned short int) (((((WrapperStruct00.var_1_10 - (22925 - WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_16)) ? ((WrapperStruct00.var_1_10 - (22925 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_16))))) : 1)) && ((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_12 == ((unsigned char) ((! WrapperStruct00.var_1_15) || (! (! 0)))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR ((((WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_1 == ((signed char) ((((((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) < (WrapperStruct00.var_1_6)) ? (((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_4))) && (((((((WrapperStruct00.var_1_17 * 127.75)) > ((WrapperStruct00.var_1_17 / 3.4))) ? ((WrapperStruct00.var_1_17 * 127.75)) : ((WrapperStruct00.var_1_17 / 3.4)))) >= WrapperStruct00.var_1_17) ? (WrapperStruct00.var_1_7 == ((unsigned short int) (((((WrapperStruct00.var_1_10 - (22925 - WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_16)) ? ((WrapperStruct00.var_1_10 - (22925 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_16))))) : 1)) && ((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_12 == ((unsigned char) ((! WrapperStruct00.var_1_15) || (! (! 0))))))) && (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR (((((WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_1 == ((signed char) ((((((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) < (WrapperStruct00.var_1_6)) ? (((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_4))) && (((((((WrapperStruct00.var_1_17 * 127.75)) > ((WrapperStruct00.var_1_17 / 3.4))) ? ((WrapperStruct00.var_1_17 * 127.75)) : ((WrapperStruct00.var_1_17 / 3.4)))) >= WrapperStruct00.var_1_17) ? (WrapperStruct00.var_1_7 == ((unsigned short int) (((((WrapperStruct00.var_1_10 - (22925 - WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_16)) ? ((WrapperStruct00.var_1_10 - (22925 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_16))))) : 1)) && ((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_12 == ((unsigned char) ((! WrapperStruct00.var_1_15) || (! (! 0))))))) && (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_5))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_18)) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR ((((((WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_1 == ((signed char) ((((((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) < (WrapperStruct00.var_1_6)) ? (((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_4))) && (((((((WrapperStruct00.var_1_17 * 127.75)) > ((WrapperStruct00.var_1_17 / 3.4))) ? ((WrapperStruct00.var_1_17 * 127.75)) : ((WrapperStruct00.var_1_17 / 3.4)))) >= WrapperStruct00.var_1_17) ? (WrapperStruct00.var_1_7 == ((unsigned short int) (((((WrapperStruct00.var_1_10 - (22925 - WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_16)) ? ((WrapperStruct00.var_1_10 - (22925 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_16))))) : 1)) && ((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_12 == ((unsigned char) ((! WrapperStruct00.var_1_15) || (! (! 0))))))) && (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_5))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_18))) && (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_4)) VAL [WrapperStruct00={4:0}, isInitial=1] [L107-L108] return ((((((WrapperStruct00.var_1_12 || (64.75f < WrapperStruct00.var_1_17)) ? (WrapperStruct00.var_1_12 ? (WrapperStruct00.var_1_1 == ((signed char) (WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_1 == ((signed char) ((((((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) < (WrapperStruct00.var_1_6)) ? (((((WrapperStruct00.var_1_4) > (WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_4) : (WrapperStruct00.var_1_5)))) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_4))) && (((((((WrapperStruct00.var_1_17 * 127.75)) > ((WrapperStruct00.var_1_17 / 3.4))) ? ((WrapperStruct00.var_1_17 * 127.75)) : ((WrapperStruct00.var_1_17 / 3.4)))) >= WrapperStruct00.var_1_17) ? (WrapperStruct00.var_1_7 == ((unsigned short int) (((((WrapperStruct00.var_1_10 - (22925 - WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_16)) ? ((WrapperStruct00.var_1_10 - (22925 - WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_16))))) : 1)) && ((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_12 == ((unsigned char) ((! WrapperStruct00.var_1_15) || (! (! 0))))))) && (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_5))) && (WrapperStruct00.var_1_17 == ((float) WrapperStruct00.var_1_18))) && (WrapperStruct00.var_1_19 == ((signed char) WrapperStruct00.var_1_4)) ; [L117] RET, EXPR property() [L117] 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, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.3s, OverallIterations: 14, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 954 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 927 mSDsluCounter, 5799 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4094 mSDsCounter, 150 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3602 IncrementalHoareTripleChecker+Invalid, 3752 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 150 mSolverCounterUnsat, 1705 mSDtfsCounter, 3602 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 638 GetRequests, 552 SyntacticMatches, 7 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred in iteration=13, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 434 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 2140 NumberOfCodeBlocks, 2140 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2123 ConstructedInterpolants, 0 QuantifiedInterpolants, 4279 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1410 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 17 InterpolantComputations, 12 PerfectInterpolantSequences, 7034/7140 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-03-04 01:37:39,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-24.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 27f1e743425525541ce4822cf6e51a4737fceae5e241bd8bfab81b1f43b03433 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:37:41,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:37:41,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:37:41,187 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:37:41,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:37:41,211 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:37:41,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:37:41,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:37:41,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:37:41,213 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:37:41,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:37:41,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:37:41,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:37:41,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:37:41,214 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:37:41,214 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:37:41,214 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:37:41,214 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:37:41,214 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:37:41,214 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:37:41,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:37:41,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:37:41,215 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:37:41,215 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:37:41,215 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:37:41,215 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:37:41,215 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:37:41,215 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:37:41,215 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:37:41,215 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:37:41,215 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:37:41,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:37:41,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:37:41,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:37:41,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:37:41,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:37:41,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:37:41,215 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:37:41,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:37:41,215 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:37:41,215 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:37:41,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:37:41,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:37:41,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:37:41,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:37:41,217 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/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 -> 27f1e743425525541ce4822cf6e51a4737fceae5e241bd8bfab81b1f43b03433 [2025-03-04 01:37:41,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:37:41,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:37:41,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:37:41,467 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:37:41,468 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:37:41,468 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-24.i [2025-03-04 01:37:42,615 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01c52eff2/3686009820b648f3a01e551d6be72f12/FLAGcda96515a [2025-03-04 01:37:42,849 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:37:42,849 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-24.i [2025-03-04 01:37:42,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01c52eff2/3686009820b648f3a01e551d6be72f12/FLAGcda96515a [2025-03-04 01:37:42,875 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01c52eff2/3686009820b648f3a01e551d6be72f12 [2025-03-04 01:37:42,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:37:42,878 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:37:42,879 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:37:42,879 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:37:42,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:37:42,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:37:42" (1/1) ... [2025-03-04 01:37:42,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b9352f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:42, skipping insertion in model container [2025-03-04 01:37:42,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:37:42" (1/1) ... [2025-03-04 01:37:42,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:37:42,994 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-24.i[916,929] [2025-03-04 01:37:43,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:37:43,045 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:37:43,052 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-24.i[916,929] [2025-03-04 01:37:43,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:37:43,092 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:37:43,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:43 WrapperNode [2025-03-04 01:37:43,093 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:37:43,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:37:43,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:37:43,095 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:37:43,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:43" (1/1) ... [2025-03-04 01:37:43,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:43" (1/1) ... [2025-03-04 01:37:43,152 INFO L138 Inliner]: procedures = 34, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 450 [2025-03-04 01:37:43,152 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:37:43,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:37:43,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:37:43,152 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:37:43,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:43" (1/1) ... [2025-03-04 01:37:43,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:43" (1/1) ... [2025-03-04 01:37:43,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:43" (1/1) ... [2025-03-04 01:37:43,184 INFO L175 MemorySlicer]: Split 127 memory accesses to 2 slices as follows [2, 125]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 32 writes are split as follows [0, 32]. [2025-03-04 01:37:43,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:43" (1/1) ... [2025-03-04 01:37:43,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:43" (1/1) ... [2025-03-04 01:37:43,209 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:43" (1/1) ... [2025-03-04 01:37:43,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:43" (1/1) ... [2025-03-04 01:37:43,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:43" (1/1) ... [2025-03-04 01:37:43,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:43" (1/1) ... [2025-03-04 01:37:43,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:37:43,226 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:37:43,226 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:37:43,226 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:37:43,227 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:43" (1/1) ... [2025-03-04 01:37:43,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:37:43,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:37:43,254 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:37:43,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:37:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:37:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:37:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:37:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:37:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:37:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:37:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:37:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:37:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:37:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:37:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:37:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-04 01:37:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-04 01:37:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-04 01:37:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-04 01:37:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:37:43,279 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:37:43,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-04 01:37:43,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-04 01:37:43,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:37:43,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:37:43,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:37:43,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:37:43,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:37:43,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:37:43,394 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:37:43,396 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:38:02,414 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L107: havoc property_#t~mem73#1;havoc property_#t~mem72#1;havoc property_#t~short74#1;havoc property_#t~ite96#1;havoc property_#t~mem75#1;havoc property_#t~ite93#1;havoc property_#t~mem78#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem92#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite83#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~mem84#1;havoc property_#t~ite91#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~mem90#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~ite111#1;havoc property_#t~mem110#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~mem105#1;havoc property_#t~ite109#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~mem108#1;havoc property_#t~short112#1;havoc property_#t~mem113#1;havoc property_#t~ite118#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem117#1;havoc property_#t~mem116#1;havoc property_#t~short119#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short122#1;havoc property_#t~mem124#1;havoc property_#t~mem123#1;havoc property_#t~short125#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~short128#1; [2025-03-04 01:38:02,463 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2025-03-04 01:38:02,464 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:38:02,475 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:38:02,476 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:38:02,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:38:02 BoogieIcfgContainer [2025-03-04 01:38:02,476 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:38:02,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:38:02,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:38:02,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:38:02,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:37:42" (1/3) ... [2025-03-04 01:38:02,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119092fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:38:02, skipping insertion in model container [2025-03-04 01:38:02,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:37:43" (2/3) ... [2025-03-04 01:38:02,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@119092fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:38:02, skipping insertion in model container [2025-03-04 01:38:02,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:38:02" (3/3) ... [2025-03-04 01:38:02,485 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-24.i [2025-03-04 01:38:02,495 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:38:02,497 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-24.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:38:02,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:38:02,546 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;@4d053bc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:38:02,546 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:38:02,549 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 83 states have internal predecessors, (114), 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-03-04 01:38:02,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:38:02,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:02,559 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] [2025-03-04 01:38:02,559 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:02,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:02,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1880348313, now seen corresponding path program 1 times [2025-03-04 01:38:02,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:38:02,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696684406] [2025-03-04 01:38:02,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:02,571 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-03-04 01:38:02,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:38:02,572 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-04 01:38:02,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:38:02,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:38:03,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:38:03,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:03,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:03,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:38:03,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:38:03,546 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 01:38:03,546 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:38:03,547 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:38:03,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696684406] [2025-03-04 01:38:03,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696684406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:03,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:03,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:38:03,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202951161] [2025-03-04 01:38:03,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:03,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:38:03,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:38:03,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:38:03,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:38:03,572 INFO L87 Difference]: Start difference. First operand has 100 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 83 states have internal predecessors, (114), 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 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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-03-04 01:38:03,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:03,604 INFO L93 Difference]: Finished difference Result 194 states and 298 transitions. [2025-03-04 01:38:03,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:38:03,607 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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 124 [2025-03-04 01:38:03,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:03,620 INFO L225 Difference]: With dead ends: 194 [2025-03-04 01:38:03,620 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 01:38:03,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 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-03-04 01:38:03,625 INFO L435 NwaCegarLoop]: 139 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, 139 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-03-04 01:38:03,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:38:03,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 01:38:03,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-04 01:38:03,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 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-03-04 01:38:03,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2025-03-04 01:38:03,664 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 124 [2025-03-04 01:38:03,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:03,664 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2025-03-04 01:38:03,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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-03-04 01:38:03,665 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2025-03-04 01:38:03,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:38:03,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:03,667 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] [2025-03-04 01:38:03,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:38:03,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-04 01:38:03,867 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:03,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:03,868 INFO L85 PathProgramCache]: Analyzing trace with hash -395552172, now seen corresponding path program 1 times [2025-03-04 01:38:03,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:38:03,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489859550] [2025-03-04 01:38:03,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:03,869 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-03-04 01:38:03,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:38:03,872 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-04 01:38:03,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:38:03,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:38:04,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:38:04,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:04,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:04,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:38:04,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:38:05,351 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:38:05,352 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:38:05,353 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:38:05,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489859550] [2025-03-04 01:38:05,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489859550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:05,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:05,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:38:05,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336763038] [2025-03-04 01:38:05,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:05,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:38:05,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:38:05,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:38:05,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:38:05,355 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-03-04 01:38:06,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:06,102 INFO L93 Difference]: Finished difference Result 196 states and 282 transitions. [2025-03-04 01:38:06,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:38:06,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 124 [2025-03-04 01:38:06,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:06,104 INFO L225 Difference]: With dead ends: 196 [2025-03-04 01:38:06,104 INFO L226 Difference]: Without dead ends: 102 [2025-03-04 01:38:06,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:38:06,106 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:06,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 520 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:38:06,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-04 01:38:06,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-03-04 01:38:06,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 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-03-04 01:38:06,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2025-03-04 01:38:06,114 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 124 [2025-03-04 01:38:06,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:06,115 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2025-03-04 01:38:06,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-03-04 01:38:06,116 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2025-03-04 01:38:06,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:38:06,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:06,117 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] [2025-03-04 01:38:06,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:38:06,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-03-04 01:38:06,318 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:06,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:06,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2091960661, now seen corresponding path program 1 times [2025-03-04 01:38:06,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:38:06,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328477788] [2025-03-04 01:38:06,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:06,319 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-03-04 01:38:06,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:38:06,321 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-03-04 01:38:06,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:38:06,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:38:07,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:38:07,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:07,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:07,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:38:07,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:38:08,052 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:38:08,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:38:08,052 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:38:08,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328477788] [2025-03-04 01:38:08,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328477788] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:08,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:08,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:38:08,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116745696] [2025-03-04 01:38:08,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:08,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:38:08,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:38:08,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:38:08,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:38:08,053 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-03-04 01:38:09,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:09,030 INFO L93 Difference]: Finished difference Result 202 states and 287 transitions. [2025-03-04 01:38:09,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:38:09,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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 124 [2025-03-04 01:38:09,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:09,032 INFO L225 Difference]: With dead ends: 202 [2025-03-04 01:38:09,032 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 01:38:09,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:38:09,033 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:09,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 640 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:38:09,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 01:38:09,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-03-04 01:38:09,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 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-03-04 01:38:09,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2025-03-04 01:38:09,041 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 124 [2025-03-04 01:38:09,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:09,041 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2025-03-04 01:38:09,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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-03-04 01:38:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2025-03-04 01:38:09,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:38:09,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:09,043 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] [2025-03-04 01:38:09,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:38:09,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-03-04 01:38:09,244 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:09,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:09,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1315502954, now seen corresponding path program 1 times [2025-03-04 01:38:09,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:38:09,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055169475] [2025-03-04 01:38:09,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:09,245 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-03-04 01:38:09,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:38:09,247 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-03-04 01:38:09,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:38:09,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:38:10,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:38:10,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:10,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:10,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:38:10,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:38:11,185 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:38:11,185 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:38:11,185 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:38:11,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055169475] [2025-03-04 01:38:11,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055169475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:38:11,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:38:11,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:38:11,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826150622] [2025-03-04 01:38:11,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:38:11,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:38:11,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:38:11,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:38:11,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:38:11,187 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-03-04 01:38:12,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:38:12,507 INFO L93 Difference]: Finished difference Result 206 states and 291 transitions. [2025-03-04 01:38:12,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:38:12,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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 124 [2025-03-04 01:38:12,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:38:12,509 INFO L225 Difference]: With dead ends: 206 [2025-03-04 01:38:12,509 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 01:38:12,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:38:12,509 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:38:12,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 761 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 01:38:12,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 01:38:12,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-03-04 01:38:12,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 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-03-04 01:38:12,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2025-03-04 01:38:12,519 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 124 [2025-03-04 01:38:12,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:38:12,520 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2025-03-04 01:38:12,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-03-04 01:38:12,520 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2025-03-04 01:38:12,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:38:12,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:38:12,521 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] [2025-03-04 01:38:12,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2025-03-04 01:38:12,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-03-04 01:38:12,721 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:38:12,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:38:12,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1314579433, now seen corresponding path program 1 times [2025-03-04 01:38:12,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:38:12,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827058480] [2025-03-04 01:38:12,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:38:12,722 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-03-04 01:38:12,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:38:12,726 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-03-04 01:38:12,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:38:12,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:38:14,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:38:14,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:38:14,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:38:14,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 01:38:14,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:38:26,723 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 01:38:34,849 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 01:38:43,166 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 01:38:47,210 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|) (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (= |c_ULTIMATE.start_step_#t~ite34#1| .cse0) (fp.gt .cse0 (fp.div c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2025-03-04 01:38:51,302 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|) (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (= |c_ULTIMATE.start_step_#t~ite34#1| .cse0) (fp.gt .cse0 (fp.div c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2025-03-04 01:38:57,912 WARN L286 SmtUtils]: Spent 6.61s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)