./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-81.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-81.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 2b07b7903cb9834718dcbd3dbb565f62432b2101fe170e5e45b3142d9f35cf0c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:02:19,694 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:02:19,738 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:02:19,741 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:02:19,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:02:19,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:02:19,762 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:02:19,763 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:02:19,763 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:02:19,763 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:02:19,763 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:02:19,764 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:02:19,764 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:02:19,764 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:02:19,765 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:02:19,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:02:19,765 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:02:19,765 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:02:19,765 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:02:19,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:02:19,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:02:19,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:02:19,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:02:19,766 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:02:19,766 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:02:19,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:02:19,766 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:02:19,766 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:02:19,766 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:02:19,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:02:19,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:02:19,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:02:19,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:02:19,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:02:19,767 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:02:19,767 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:02:19,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:02:19,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:02:19,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:02:19,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:02:19,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:02:19,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:02:19,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:02:19,767 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 -> 2b07b7903cb9834718dcbd3dbb565f62432b2101fe170e5e45b3142d9f35cf0c [2025-03-17 06:02:19,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:02:20,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:02:20,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:02:20,003 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:02:20,004 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:02:20,004 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-81.i [2025-03-17 06:02:21,194 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4df3da164/72b46ced789f42208af87ca16fe7b055/FLAG842d810e3 [2025-03-17 06:02:21,423 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:02:21,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-81.i [2025-03-17 06:02:21,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4df3da164/72b46ced789f42208af87ca16fe7b055/FLAG842d810e3 [2025-03-17 06:02:21,753 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4df3da164/72b46ced789f42208af87ca16fe7b055 [2025-03-17 06:02:21,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:02:21,757 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:02:21,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:02:21,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:02:21,762 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:02:21,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:02:21" (1/1) ... [2025-03-17 06:02:21,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ec176d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:21, skipping insertion in model container [2025-03-17 06:02:21,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:02:21" (1/1) ... [2025-03-17 06:02:21,775 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:02:21,883 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-81.i[916,929] [2025-03-17 06:02:21,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:02:21,931 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:02:21,939 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-81.i[916,929] [2025-03-17 06:02:21,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:02:22,007 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:02:22,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:22 WrapperNode [2025-03-17 06:02:22,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:02:22,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:02:22,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:02:22,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:02:22,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:22" (1/1) ... [2025-03-17 06:02:22,026 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:22" (1/1) ... [2025-03-17 06:02:22,060 INFO L138 Inliner]: procedures = 30, calls = 172, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 545 [2025-03-17 06:02:22,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:02:22,065 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:02:22,065 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:02:22,065 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:02:22,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:22" (1/1) ... [2025-03-17 06:02:22,075 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:22" (1/1) ... [2025-03-17 06:02:22,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:22" (1/1) ... [2025-03-17 06:02:22,086 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 06:02:22,086 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:22" (1/1) ... [2025-03-17 06:02:22,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:22" (1/1) ... [2025-03-17 06:02:22,100 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:22" (1/1) ... [2025-03-17 06:02:22,102 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:22" (1/1) ... [2025-03-17 06:02:22,104 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:22" (1/1) ... [2025-03-17 06:02:22,104 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:22" (1/1) ... [2025-03-17 06:02:22,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:02:22,108 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:02:22,108 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:02:22,108 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:02:22,110 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:22" (1/1) ... [2025-03-17 06:02:22,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:02:22,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:02:22,146 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-17 06:02:22,149 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-17 06:02:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:02:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 06:02:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 06:02:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 06:02:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 06:02:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 06:02:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 06:02:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:02:22,167 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:02:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 06:02:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:02:22,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:02:22,263 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:02:22,264 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:02:22,698 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc property_#t~mem98#1;havoc property_#t~ite109#1;havoc property_#t~mem108#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~ite107#1;havoc property_#t~mem103#1;havoc property_#t~mem106#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~bitwise110#1;havoc property_#t~ite122#1;havoc property_#t~mem111#1;havoc property_#t~ite115#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem121#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~short127#1;havoc property_#t~ite135#1;havoc property_#t~mem131#1;havoc property_#t~mem128#1;havoc property_#t~ite130#1;havoc property_#t~mem129#1;havoc property_#t~mem134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~short136#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~ite152#1;havoc property_#t~mem141#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~ite149#1;havoc property_#t~mem146#1;havoc property_#t~mem142#1;havoc property_#t~ite145#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~mem148#1;havoc property_#t~mem147#1;havoc property_#t~mem151#1;havoc property_#t~mem150#1;havoc property_#t~short153#1; [2025-03-17 06:02:22,736 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2025-03-17 06:02:22,737 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:02:22,753 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:02:22,753 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:02:22,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:02:22 BoogieIcfgContainer [2025-03-17 06:02:22,754 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:02:22,757 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:02:22,757 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:02:22,761 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:02:22,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:02:21" (1/3) ... [2025-03-17 06:02:22,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c02b81a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:02:22, skipping insertion in model container [2025-03-17 06:02:22,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:22" (2/3) ... [2025-03-17 06:02:22,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c02b81a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:02:22, skipping insertion in model container [2025-03-17 06:02:22,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:02:22" (3/3) ... [2025-03-17 06:02:22,764 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-81.i [2025-03-17 06:02:22,776 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:02:22,777 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-81.i that has 2 procedures, 123 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:02:22,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:02:22,826 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;@20668f02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:02:22,826 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:02:22,831 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 102 states have (on average 1.4607843137254901) internal successors, (149), 103 states have internal predecessors, (149), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:02:22,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 06:02:22,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:22,841 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:02:22,841 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:22,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:22,845 INFO L85 PathProgramCache]: Analyzing trace with hash -2063760145, now seen corresponding path program 1 times [2025-03-17 06:02:22,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:22,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059219255] [2025-03-17 06:02:22,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:22,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:22,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 06:02:23,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 06:02:23,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:23,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-17 06:02:23,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:23,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059219255] [2025-03-17 06:02:23,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059219255] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:02:23,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432288339] [2025-03-17 06:02:23,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:23,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:02:23,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:02:23,203 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-17 06:02:23,204 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-17 06:02:23,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 06:02:23,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 06:02:23,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:23,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:23,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:02:23,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-17 06:02:23,454 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:23,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432288339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:23,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:02:23,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:02:23,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560770037] [2025-03-17 06:02:23,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:23,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:02:23,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:23,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:02:23,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:02:23,478 INFO L87 Difference]: Start difference. First operand has 123 states, 102 states have (on average 1.4607843137254901) internal successors, (149), 103 states have internal predecessors, (149), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:02:23,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:23,502 INFO L93 Difference]: Finished difference Result 243 states and 386 transitions. [2025-03-17 06:02:23,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:02:23,505 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 144 [2025-03-17 06:02:23,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:23,511 INFO L225 Difference]: With dead ends: 243 [2025-03-17 06:02:23,511 INFO L226 Difference]: Without dead ends: 121 [2025-03-17 06:02:23,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 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-17 06:02:23,518 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:23,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:02:23,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-17 06:02:23,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-17 06:02:23,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 101 states have internal predecessors, (143), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:02:23,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 179 transitions. [2025-03-17 06:02:23,553 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 179 transitions. Word has length 144 [2025-03-17 06:02:23,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:23,553 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 179 transitions. [2025-03-17 06:02:23,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:02:23,554 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 179 transitions. [2025-03-17 06:02:23,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-17 06:02:23,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:23,556 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:02:23,564 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-17 06:02:23,756 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-17 06:02:23,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:23,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:23,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1483259809, now seen corresponding path program 1 times [2025-03-17 06:02:23,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:23,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930567159] [2025-03-17 06:02:23,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:23,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:23,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-17 06:02:23,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-17 06:02:23,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:23,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:24,368 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:02:24,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:24,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930567159] [2025-03-17 06:02:24,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930567159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:24,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:24,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:02:24,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605589798] [2025-03-17 06:02:24,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:24,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:02:24,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:24,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:02:24,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:02:24,373 INFO L87 Difference]: Start difference. First operand 121 states and 179 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:02:24,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:24,684 INFO L93 Difference]: Finished difference Result 362 states and 536 transitions. [2025-03-17 06:02:24,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:02:24,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2025-03-17 06:02:24,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:24,687 INFO L225 Difference]: With dead ends: 362 [2025-03-17 06:02:24,687 INFO L226 Difference]: Without dead ends: 242 [2025-03-17 06:02:24,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:02:24,688 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 170 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:24,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 380 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:02:24,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-17 06:02:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 213. [2025-03-17 06:02:24,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 174 states have (on average 1.396551724137931) internal successors, (243), 174 states have internal predecessors, (243), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 06:02:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 315 transitions. [2025-03-17 06:02:24,743 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 315 transitions. Word has length 144 [2025-03-17 06:02:24,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:24,744 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 315 transitions. [2025-03-17 06:02:24,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:02:24,744 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 315 transitions. [2025-03-17 06:02:24,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 06:02:24,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:24,748 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:02:24,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:02:24,748 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:24,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:24,749 INFO L85 PathProgramCache]: Analyzing trace with hash 418300027, now seen corresponding path program 1 times [2025-03-17 06:02:24,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:24,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851816590] [2025-03-17 06:02:24,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:24,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:24,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 06:02:24,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 06:02:24,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:24,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:25,002 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-17 06:02:25,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:25,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851816590] [2025-03-17 06:02:25,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851816590] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:02:25,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954349856] [2025-03-17 06:02:25,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:25,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:02:25,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:02:25,005 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-17 06:02:25,006 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-17 06:02:25,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 06:02:25,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 06:02:25,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:25,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:25,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:02:25,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:02:25,257 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:25,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954349856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:25,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:02:25,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 06:02:25,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439271194] [2025-03-17 06:02:25,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:25,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:02:25,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:25,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:02:25,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:02:25,260 INFO L87 Difference]: Start difference. First operand 213 states and 315 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:02:25,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:25,291 INFO L93 Difference]: Finished difference Result 337 states and 499 transitions. [2025-03-17 06:02:25,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:02:25,292 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-03-17 06:02:25,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:25,294 INFO L225 Difference]: With dead ends: 337 [2025-03-17 06:02:25,295 INFO L226 Difference]: Without dead ends: 217 [2025-03-17 06:02:25,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:02:25,296 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:25,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:02:25,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-17 06:02:25,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2025-03-17 06:02:25,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 178 states have (on average 1.3876404494382022) internal successors, (247), 178 states have internal predecessors, (247), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 06:02:25,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 319 transitions. [2025-03-17 06:02:25,326 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 319 transitions. Word has length 145 [2025-03-17 06:02:25,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:25,328 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 319 transitions. [2025-03-17 06:02:25,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:02:25,328 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 319 transitions. [2025-03-17 06:02:25,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 06:02:25,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:25,330 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:02:25,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 06:02:25,530 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,SelfDestructingSolverStorable2 [2025-03-17 06:02:25,531 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:25,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:25,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1607660921, now seen corresponding path program 1 times [2025-03-17 06:02:25,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:25,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169961143] [2025-03-17 06:02:25,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:25,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:25,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 06:02:25,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 06:02:25,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:25,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:25,982 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:02:25,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:25,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169961143] [2025-03-17 06:02:25,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169961143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:25,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:25,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:02:25,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125499959] [2025-03-17 06:02:25,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:25,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:02:25,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:25,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:02:25,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:02:25,985 INFO L87 Difference]: Start difference. First operand 217 states and 319 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:02:26,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:26,218 INFO L93 Difference]: Finished difference Result 397 states and 581 transitions. [2025-03-17 06:02:26,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:02:26,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-03-17 06:02:26,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:26,222 INFO L225 Difference]: With dead ends: 397 [2025-03-17 06:02:26,223 INFO L226 Difference]: Without dead ends: 246 [2025-03-17 06:02:26,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:02:26,224 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 162 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:26,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 396 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:02:26,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-17 06:02:26,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 217. [2025-03-17 06:02:26,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 178 states have (on average 1.3764044943820224) internal successors, (245), 178 states have internal predecessors, (245), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 06:02:26,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 317 transitions. [2025-03-17 06:02:26,255 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 317 transitions. Word has length 147 [2025-03-17 06:02:26,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:26,255 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 317 transitions. [2025-03-17 06:02:26,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:02:26,255 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 317 transitions. [2025-03-17 06:02:26,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 06:02:26,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:26,257 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:02:26,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:02:26,257 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:26,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:26,257 INFO L85 PathProgramCache]: Analyzing trace with hash 938208929, now seen corresponding path program 1 times [2025-03-17 06:02:26,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:26,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453088309] [2025-03-17 06:02:26,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:26,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:26,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 06:02:26,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 06:02:26,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:26,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:26,614 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:02:26,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:26,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453088309] [2025-03-17 06:02:26,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453088309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:26,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:26,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:02:26,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344282673] [2025-03-17 06:02:26,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:26,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:02:26,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:26,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:02:26,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:02:26,618 INFO L87 Difference]: Start difference. First operand 217 states and 317 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:02:26,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:26,917 INFO L93 Difference]: Finished difference Result 389 states and 564 transitions. [2025-03-17 06:02:26,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:02:26,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2025-03-17 06:02:26,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:26,921 INFO L225 Difference]: With dead ends: 389 [2025-03-17 06:02:26,921 INFO L226 Difference]: Without dead ends: 260 [2025-03-17 06:02:26,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:02:26,922 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 48 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:26,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 582 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:02:26,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-17 06:02:26,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 221. [2025-03-17 06:02:26,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 182 states have (on average 1.3681318681318682) internal successors, (249), 182 states have internal predecessors, (249), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 06:02:26,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 321 transitions. [2025-03-17 06:02:26,942 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 321 transitions. Word has length 149 [2025-03-17 06:02:26,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:26,943 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 321 transitions. [2025-03-17 06:02:26,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:02:26,943 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 321 transitions. [2025-03-17 06:02:26,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 06:02:26,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:26,945 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:02:26,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:02:26,945 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:26,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:26,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1976340255, now seen corresponding path program 1 times [2025-03-17 06:02:26,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:26,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548025041] [2025-03-17 06:02:26,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:26,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:26,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 06:02:27,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 06:02:27,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:27,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:02:27,084 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:02:27,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 06:02:27,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 06:02:27,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:27,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:02:27,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:02:27,207 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:02:27,208 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 06:02:27,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:02:27,212 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-17 06:02:27,268 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:02:27,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:02:27 BoogieIcfgContainer [2025-03-17 06:02:27,274 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:02:27,275 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:02:27,275 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:02:27,275 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:02:27,276 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:02:22" (3/4) ... [2025-03-17 06:02:27,278 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 06:02:27,278 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:02:27,279 INFO L158 Benchmark]: Toolchain (without parser) took 5522.22ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 111.8MB in the beginning and 191.5MB in the end (delta: -79.7MB). Peak memory consumption was 101.4MB. Max. memory is 16.1GB. [2025-03-17 06:02:27,279 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:02:27,280 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.24ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 93.8MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:02:27,280 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.92ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 89.6MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:02:27,280 INFO L158 Benchmark]: Boogie Preprocessor took 42.49ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 86.5MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:02:27,280 INFO L158 Benchmark]: IcfgBuilder took 645.94ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 49.8MB in the end (delta: 36.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 06:02:27,280 INFO L158 Benchmark]: TraceAbstraction took 4517.21ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 49.8MB in the beginning and 191.6MB in the end (delta: -141.7MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. [2025-03-17 06:02:27,280 INFO L158 Benchmark]: Witness Printer took 3.52ms. Allocated memory is still 318.8MB. Free memory was 191.6MB in the beginning and 191.5MB in the end (delta: 97.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:02:27,281 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.20ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.24ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 93.8MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.92ms. Allocated memory is still 142.6MB. Free memory was 93.8MB in the beginning and 89.6MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.49ms. Allocated memory is still 142.6MB. Free memory was 89.6MB in the beginning and 86.5MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 645.94ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 49.8MB in the end (delta: 36.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4517.21ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 49.8MB in the beginning and 191.6MB in the end (delta: -141.7MB). Peak memory consumption was 34.3MB. Max. memory is 16.1GB. * Witness Printer took 3.52ms. Allocated memory is still 318.8MB. Free memory was 191.6MB in the beginning and 191.5MB in the end (delta: 97.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 126. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 9999.5, 1, 4.5, 2.5, 0.0, 999999999999.3, -128, 16, 16, 5, 1, 16, 32647, 128, -8 }; [L57] unsigned short int last_1_WrapperStruct00_var_1_13 = 5; [L58] signed long int last_1_WrapperStruct00_var_1_18 = -8; [L130] isInitial = 1 [L131] FCALL initially() [L132] COND TRUE 1 [L133] CALL updateLastVariables() [L122] EXPR WrapperStruct00.var_1_13 [L122] last_1_WrapperStruct00_var_1_13 = WrapperStruct00.var_1_13 [L123] EXPR WrapperStruct00.var_1_18 [L123] last_1_WrapperStruct00_var_1_18 = WrapperStruct00.var_1_18 [L133] RET updateLastVariables() [L134] CALL updateVariables() [L91] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L93] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L94] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double() [L95] EXPR WrapperStruct00.var_1_3 [L95] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_3 [L95] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L95] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L96] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L97] EXPR WrapperStruct00.var_1_4 [L97] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L97] EXPR WrapperStruct00.var_1_4 [L97] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L97] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L97] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L97] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L98] WrapperStruct00.var_1_5 = __VERIFIER_nondet_double() [L99] EXPR WrapperStruct00.var_1_5 [L99] EXPR WrapperStruct00.var_1_5 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_5 [L99] EXPR WrapperStruct00.var_1_5 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L99] EXPR (WrapperStruct00.var_1_5 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L100] WrapperStruct00.var_1_6 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_6 [L101] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_6 [L101] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L101] EXPR (WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L102] WrapperStruct00.var_1_11 = __VERIFIER_nondet_char() [L103] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L104] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L105] WrapperStruct00.var_1_12 = __VERIFIER_nondet_char() [L106] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L107] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L108] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L110] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L111] WrapperStruct00.var_1_15 = __VERIFIER_nondet_ushort() [L112] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L113] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 65534) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L114] WrapperStruct00.var_1_16 = __VERIFIER_nondet_ushort() [L115] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L116] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L117] WrapperStruct00.var_1_17 = __VERIFIER_nondet_ushort() [L118] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L119] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L134] RET updateVariables() [L135] CALL step() [L62] signed long int stepLocal_0 = (((-25) < (last_1_WrapperStruct00_var_1_18)) ? (-25) : (last_1_WrapperStruct00_var_1_18)); VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8, stepLocal_0=-25] [L63] EXPR last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8, stepLocal_0=-25] [L63] COND TRUE stepLocal_0 != (last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13) [L64] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L64] COND TRUE WrapperStruct00.var_1_2 [L65] EXPR WrapperStruct00.var_1_11 [L65] EXPR WrapperStruct00.var_1_12 [L65] WrapperStruct00.var_1_7 = (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12) [L70] EXPR WrapperStruct00.var_1_11 [L70] EXPR WrapperStruct00.var_1_7 [L70] unsigned char stepLocal_1 = WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_7; [L71] stepLocal_1 && WrapperStruct00.var_1_14 [L71] EXPR WrapperStruct00.var_1_14 [L71] stepLocal_1 && WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L71] COND FALSE !(stepLocal_1 && WrapperStruct00.var_1_14) [L74] EXPR WrapperStruct00.var_1_16 [L74] EXPR WrapperStruct00.var_1_17 [L74] WrapperStruct00.var_1_13 = ((WrapperStruct00.var_1_16 - 5) + WrapperStruct00.var_1_17) [L76] EXPR WrapperStruct00.var_1_7 [L76] signed char stepLocal_2 = WrapperStruct00.var_1_7; [L77] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8, stepLocal_2=62] [L77] COND FALSE !(stepLocal_2 > WrapperStruct00.var_1_16) [L84] EXPR WrapperStruct00.var_1_15 [L84] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_15 [L86] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L86] COND TRUE WrapperStruct00.var_1_2 [L87] EXPR WrapperStruct00.var_1_3 [L87] EXPR WrapperStruct00.var_1_4 [L87] EXPR WrapperStruct00.var_1_5 [L87] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L87] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))) [L87] EXPR WrapperStruct00.var_1_3 [L87] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L87] WrapperStruct00.var_1_1 = ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))))) [L135] RET step() [L136] CALL, EXPR property() [L126] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L126] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))))))) : 1 [L126] EXPR WrapperStruct00.var_1_1 [L126] EXPR WrapperStruct00.var_1_3 [L126] EXPR WrapperStruct00.var_1_4 [L126] EXPR WrapperStruct00.var_1_5 [L126] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L126] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))) [L126] EXPR WrapperStruct00.var_1_3 [L126] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L126] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))))))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L126] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))))))) : 1) && ((((((-25) < (last_1_WrapperStruct00_var_1_18)) ? (-25) : (last_1_WrapperStruct00_var_1_18))) != (last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13)) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((signed char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12))) : 1) : (WrapperStruct00.var_1_7 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_11)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L126] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))))))) : 1) && ((((((-25) < (last_1_WrapperStruct00_var_1_18)) ? (-25) : (last_1_WrapperStruct00_var_1_18))) != (last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13)) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((signed char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12))) : 1) : (WrapperStruct00.var_1_7 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_11))))))) && (((WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_7) && WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((unsigned short int) ((((WrapperStruct00.var_1_15) < (100)) ? (WrapperStruct00.var_1_15) : (100))))) : (WrapperStruct00.var_1_13 == ((unsigned short int) ((WrapperStruct00.var_1_16 - 5) + WrapperStruct00.var_1_17)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L126] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))))))) : 1) && ((((((-25) < (last_1_WrapperStruct00_var_1_18)) ? (-25) : (last_1_WrapperStruct00_var_1_18))) != (last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13)) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((signed char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12))) : 1) : (WrapperStruct00.var_1_7 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_11))))))) && (((WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_7) && WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((unsigned short int) ((((WrapperStruct00.var_1_15) < (100)) ? (WrapperStruct00.var_1_15) : (100))))) : (WrapperStruct00.var_1_13 == ((unsigned short int) ((WrapperStruct00.var_1_16 - 5) + WrapperStruct00.var_1_17))))) && ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_16) ? ((WrapperStruct00.var_1_3 < (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_18 == ((signed long int) ((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L126-L127] return (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((double) ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6))))))) : 1) && ((((((-25) < (last_1_WrapperStruct00_var_1_18)) ? (-25) : (last_1_WrapperStruct00_var_1_18))) != (last_1_WrapperStruct00_var_1_18 ^ last_1_WrapperStruct00_var_1_13)) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_7 == ((signed char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_12))) : 1) : (WrapperStruct00.var_1_7 == ((signed char) ((((WrapperStruct00.var_1_12) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_11))))))) && (((WrapperStruct00.var_1_11 >= WrapperStruct00.var_1_7) && WrapperStruct00.var_1_14) ? (WrapperStruct00.var_1_13 == ((unsigned short int) ((((WrapperStruct00.var_1_15) < (100)) ? (WrapperStruct00.var_1_15) : (100))))) : (WrapperStruct00.var_1_13 == ((unsigned short int) ((WrapperStruct00.var_1_16 - 5) + WrapperStruct00.var_1_17))))) && ((WrapperStruct00.var_1_7 > WrapperStruct00.var_1_16) ? ((WrapperStruct00.var_1_3 < (WrapperStruct00.var_1_5 - WrapperStruct00.var_1_6)) ? (WrapperStruct00.var_1_18 == ((signed long int) ((((WrapperStruct00.var_1_15) < 0 ) ? -(WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_15))) ; [L136] RET, EXPR property() [L136] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_13=5, last_1_WrapperStruct00_var_1_18=-8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 203 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 6, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 380 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 380 mSDsluCounter, 2049 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1262 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 538 IncrementalHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 787 mSDtfsCounter, 538 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 314 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=5, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 97 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1169 NumberOfCodeBlocks, 1169 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1011 ConstructedInterpolants, 0 QuantifiedInterpolants, 1360 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1035 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 5 PerfectInterpolantSequences, 4199/4284 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-17 06:02:27,301 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-81.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 2b07b7903cb9834718dcbd3dbb565f62432b2101fe170e5e45b3142d9f35cf0c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:02:29,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:02:29,250 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 06:02:29,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:02:29,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:02:29,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:02:29,282 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:02:29,282 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:02:29,282 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:02:29,282 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:02:29,282 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:02:29,282 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:02:29,283 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:02:29,283 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:02:29,283 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:02:29,283 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:02:29,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:02:29,283 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:02:29,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:02:29,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:02:29,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:02:29,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:02:29,283 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:02:29,283 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 06:02:29,283 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 06:02:29,283 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 06:02:29,283 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:02:29,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:02:29,284 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:02:29,284 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:02:29,284 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:02:29,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:02:29,284 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:02:29,284 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:02:29,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:02:29,284 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:02:29,284 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:02:29,284 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:02:29,284 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:02:29,284 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 06:02:29,284 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 06:02:29,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:02:29,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:02:29,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:02:29,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:02:29,284 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 -> 2b07b7903cb9834718dcbd3dbb565f62432b2101fe170e5e45b3142d9f35cf0c [2025-03-17 06:02:29,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:02:29,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:02:29,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:02:29,516 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:02:29,517 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:02:29,518 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-81.i [2025-03-17 06:02:30,725 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5127acb62/951bef08ef26428487f014202f09d5cd/FLAG6be1b43c1 [2025-03-17 06:02:30,913 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:02:30,914 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-81.i [2025-03-17 06:02:30,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5127acb62/951bef08ef26428487f014202f09d5cd/FLAG6be1b43c1 [2025-03-17 06:02:30,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5127acb62/951bef08ef26428487f014202f09d5cd [2025-03-17 06:02:30,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:02:30,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:02:30,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:02:30,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:02:30,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:02:30,949 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:02:30" (1/1) ... [2025-03-17 06:02:30,949 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77378f2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:30, skipping insertion in model container [2025-03-17 06:02:30,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:02:30" (1/1) ... [2025-03-17 06:02:30,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:02:31,084 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-81.i[916,929] [2025-03-17 06:02:31,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:02:31,164 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:02:31,173 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-81.i[916,929] [2025-03-17 06:02:31,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:02:31,226 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:02:31,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31 WrapperNode [2025-03-17 06:02:31,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:02:31,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:02:31,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:02:31,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:02:31,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (1/1) ... [2025-03-17 06:02:31,249 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (1/1) ... [2025-03-17 06:02:31,274 INFO L138 Inliner]: procedures = 37, calls = 172, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 520 [2025-03-17 06:02:31,275 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:02:31,275 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:02:31,275 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:02:31,275 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:02:31,289 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (1/1) ... [2025-03-17 06:02:31,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (1/1) ... [2025-03-17 06:02:31,296 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (1/1) ... [2025-03-17 06:02:31,315 INFO L175 MemorySlicer]: Split 143 memory accesses to 2 slices as follows [2, 141]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 35 writes are split as follows [0, 35]. [2025-03-17 06:02:31,315 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (1/1) ... [2025-03-17 06:02:31,315 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (1/1) ... [2025-03-17 06:02:31,333 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (1/1) ... [2025-03-17 06:02:31,335 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (1/1) ... [2025-03-17 06:02:31,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (1/1) ... [2025-03-17 06:02:31,338 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (1/1) ... [2025-03-17 06:02:31,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:02:31,342 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:02:31,342 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:02:31,342 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:02:31,343 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (1/1) ... [2025-03-17 06:02:31,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:02:31,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:02:31,376 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-17 06:02:31,378 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-17 06:02:31,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:02:31,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 06:02:31,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 06:02:31,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-17 06:02:31,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-17 06:02:31,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 06:02:31,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 06:02:31,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 06:02:31,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 06:02:31,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 06:02:31,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 06:02:31,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 06:02:31,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 06:02:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 06:02:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 06:02:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-17 06:02:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-17 06:02:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-17 06:02:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-17 06:02:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-17 06:02:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-17 06:02:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:02:31,397 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:02:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:02:31,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:02:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 06:02:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 06:02:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 06:02:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 06:02:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 06:02:31,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 06:02:31,511 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:02:31,512 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:02:43,061 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc property_#t~mem97#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite106#1;havoc property_#t~mem102#1;havoc property_#t~mem105#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~ite120#1;havoc property_#t~mem109#1;havoc property_#t~ite113#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem119#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~short125#1;havoc property_#t~ite133#1;havoc property_#t~mem129#1;havoc property_#t~mem126#1;havoc property_#t~ite128#1;havoc property_#t~mem127#1;havoc property_#t~mem132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~short134#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~ite150#1;havoc property_#t~mem139#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~ite147#1;havoc property_#t~mem144#1;havoc property_#t~mem140#1;havoc property_#t~ite143#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~mem146#1;havoc property_#t~mem145#1;havoc property_#t~mem149#1;havoc property_#t~mem148#1;havoc property_#t~short151#1; [2025-03-17 06:02:43,092 INFO L? ?]: Removed 134 outVars from TransFormulas that were not future-live. [2025-03-17 06:02:43,092 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:02:43,102 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:02:43,103 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:02:43,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:02:43 BoogieIcfgContainer [2025-03-17 06:02:43,103 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:02:43,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:02:43,106 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:02:43,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:02:43,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:02:30" (1/3) ... [2025-03-17 06:02:43,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ba1fc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:02:43, skipping insertion in model container [2025-03-17 06:02:43,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:31" (2/3) ... [2025-03-17 06:02:43,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ba1fc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:02:43, skipping insertion in model container [2025-03-17 06:02:43,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:02:43" (3/3) ... [2025-03-17 06:02:43,112 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-81.i [2025-03-17 06:02:43,122 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:02:43,123 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-81.i that has 2 procedures, 115 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:02:43,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:02:43,165 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;@3bc8118d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:02:43,165 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:02:43,168 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 95 states have internal predecessors, (135), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:02:43,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 06:02:43,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:43,179 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:02:43,179 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:43,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:43,183 INFO L85 PathProgramCache]: Analyzing trace with hash 890844685, now seen corresponding path program 1 times [2025-03-17 06:02:43,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:02:43,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222025396] [2025-03-17 06:02:43,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:43,191 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-17 06:02:43,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:02:43,193 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-17 06:02:43,194 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-17 06:02:43,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 06:02:43,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 06:02:43,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:43,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:43,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:02:43,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:43,528 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-17 06:02:43,528 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:43,532 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:02:43,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222025396] [2025-03-17 06:02:43,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222025396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:43,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:43,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:02:43,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751467628] [2025-03-17 06:02:43,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:43,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:02:43,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:02:43,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:02:43,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:02:43,554 INFO L87 Difference]: Start difference. First operand has 115 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 95 states have internal predecessors, (135), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:02:43,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:43,586 INFO L93 Difference]: Finished difference Result 227 states and 358 transitions. [2025-03-17 06:02:43,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:02:43,589 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 143 [2025-03-17 06:02:43,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:43,594 INFO L225 Difference]: With dead ends: 227 [2025-03-17 06:02:43,594 INFO L226 Difference]: Without dead ends: 113 [2025-03-17 06:02:43,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 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-17 06:02:43,614 INFO L435 NwaCegarLoop]: 165 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, 165 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-17 06:02:43,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:02:43,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-17 06:02:43,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-17 06:02:43,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 93 states have internal predecessors, (129), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:02:43,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2025-03-17 06:02:43,656 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 143 [2025-03-17 06:02:43,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:43,657 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2025-03-17 06:02:43,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:02:43,657 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2025-03-17 06:02:43,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-17 06:02:43,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:43,660 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:02:43,670 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-17 06:02:43,864 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-17 06:02:43,864 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:43,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:43,865 INFO L85 PathProgramCache]: Analyzing trace with hash 451075355, now seen corresponding path program 1 times [2025-03-17 06:02:43,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:02:43,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095793300] [2025-03-17 06:02:43,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:43,866 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-17 06:02:43,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:02:43,868 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-17 06:02:43,869 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-17 06:02:43,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-17 06:02:44,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-17 06:02:44,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:44,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:44,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:02:44,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:02:44,173 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:44,174 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:02:44,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095793300] [2025-03-17 06:02:44,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095793300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:44,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:44,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:02:44,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224818964] [2025-03-17 06:02:44,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:44,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:02:44,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:02:44,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:02:44,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:02:44,177 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:02:44,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:44,253 INFO L93 Difference]: Finished difference Result 227 states and 332 transitions. [2025-03-17 06:02:44,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:02:44,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2025-03-17 06:02:44,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:44,258 INFO L225 Difference]: With dead ends: 227 [2025-03-17 06:02:44,258 INFO L226 Difference]: Without dead ends: 115 [2025-03-17 06:02:44,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 140 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-17 06:02:44,259 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:44,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 478 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:02:44,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-17 06:02:44,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-17 06:02:44,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.3789473684210527) internal successors, (131), 95 states have internal predecessors, (131), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:02:44,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 167 transitions. [2025-03-17 06:02:44,272 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 167 transitions. Word has length 143 [2025-03-17 06:02:44,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:44,273 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 167 transitions. [2025-03-17 06:02:44,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:02:44,273 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 167 transitions. [2025-03-17 06:02:44,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 06:02:44,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:44,277 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:02:44,285 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-17 06:02:44,477 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-17 06:02:44,477 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:44,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:44,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1891854745, now seen corresponding path program 1 times [2025-03-17 06:02:44,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:02:44,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190519906] [2025-03-17 06:02:44,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:44,479 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-17 06:02:44,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:02:44,481 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-17 06:02:44,481 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-17 06:02:44,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-17 06:02:44,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 06:02:44,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:44,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:44,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 06:02:44,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-17 06:02:44,934 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:44,934 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:02:44,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190519906] [2025-03-17 06:02:44,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190519906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:44,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:44,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:02:44,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715272069] [2025-03-17 06:02:44,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:44,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:02:44,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:02:44,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:02:44,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:02:44,936 INFO L87 Difference]: Start difference. First operand 115 states and 167 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:02:51,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:02:56,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:02:57,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:02:59,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:59,013 INFO L93 Difference]: Finished difference Result 261 states and 376 transitions. [2025-03-17 06:02:59,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:02:59,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-03-17 06:02:59,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:59,015 INFO L225 Difference]: With dead ends: 261 [2025-03-17 06:02:59,015 INFO L226 Difference]: Without dead ends: 147 [2025-03-17 06:02:59,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:02:59,016 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 41 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:59,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 534 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 211 Invalid, 1 Unknown, 0 Unchecked, 14.0s Time] [2025-03-17 06:02:59,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-17 06:02:59,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 117. [2025-03-17 06:02:59,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 97 states have internal predecessors, (133), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:02:59,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions. [2025-03-17 06:02:59,024 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 145 [2025-03-17 06:02:59,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:59,025 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions. [2025-03-17 06:02:59,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-17 06:02:59,025 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2025-03-17 06:02:59,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 06:02:59,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:59,027 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:02:59,040 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-17 06:02:59,229 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-17 06:02:59,229 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:59,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:59,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1841157225, now seen corresponding path program 1 times [2025-03-17 06:02:59,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:02:59,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717641296] [2025-03-17 06:02:59,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:59,230 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-17 06:02:59,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:02:59,233 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-17 06:02:59,234 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-17 06:02:59,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 06:02:59,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 06:02:59,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:59,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:59,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:02:59,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:59,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:59,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-17 06:03:00,035 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2025-03-17 06:03:00,035 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:03:00,035 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:03:00,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717641296] [2025-03-17 06:03:00,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [717641296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:00,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:00,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:03:00,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58796068] [2025-03-17 06:03:00,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:00,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:03:00,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:03:00,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:03:00,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:03:00,037 INFO L87 Difference]: Start difference. First operand 117 states and 169 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:03:06,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:03:08,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:03:13,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:03:14,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:03:15,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:15,873 INFO L93 Difference]: Finished difference Result 234 states and 338 transitions. [2025-03-17 06:03:15,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:03:15,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 147 [2025-03-17 06:03:15,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:15,876 INFO L225 Difference]: With dead ends: 234 [2025-03-17 06:03:15,876 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 06:03:15,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:03:15,877 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 148 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:15,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 459 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 2 Unknown, 0 Unchecked, 15.7s Time] [2025-03-17 06:03:15,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 06:03:15,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-17 06:03:15,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.3608247422680413) internal successors, (132), 97 states have internal predecessors, (132), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:03:15,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 168 transitions. [2025-03-17 06:03:15,894 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 168 transitions. Word has length 147 [2025-03-17 06:03:15,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:15,894 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 168 transitions. [2025-03-17 06:03:15,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:03:15,894 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 168 transitions. [2025-03-17 06:03:15,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 06:03:15,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:15,895 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:03:15,912 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-17 06:03:16,096 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-17 06:03:16,096 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:16,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:16,097 INFO L85 PathProgramCache]: Analyzing trace with hash -2042945671, now seen corresponding path program 1 times [2025-03-17 06:03:16,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:03:16,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978022249] [2025-03-17 06:03:16,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:16,097 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-17 06:03:16,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:03:16,099 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-17 06:03:16,100 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-17 06:03:16,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 06:03:16,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 06:03:16,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:16,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:16,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:03:16,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:03:16,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:16,858 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 175 treesize of output 67 [2025-03-17 06:03:16,916 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-03-17 06:03:16,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:03:16,917 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:03:16,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978022249] [2025-03-17 06:03:16,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978022249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:16,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:16,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:03:16,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837800113] [2025-03-17 06:03:16,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:16,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:03:16,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:03:16,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:03:16,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:03:16,918 INFO L87 Difference]: Start difference. First operand 117 states and 168 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:03:23,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:03:26,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:03:30,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:03:31,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:31,423 INFO L93 Difference]: Finished difference Result 234 states and 336 transitions. [2025-03-17 06:03:31,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:03:31,424 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 149 [2025-03-17 06:03:31,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:31,425 INFO L225 Difference]: With dead ends: 234 [2025-03-17 06:03:31,425 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 06:03:31,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:03:31,426 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 138 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:31,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 455 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 194 Invalid, 1 Unknown, 0 Unchecked, 14.4s Time] [2025-03-17 06:03:31,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 06:03:31,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-17 06:03:31,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:03:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 167 transitions. [2025-03-17 06:03:31,433 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 167 transitions. Word has length 149 [2025-03-17 06:03:31,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:31,433 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 167 transitions. [2025-03-17 06:03:31,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:03:31,436 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 167 transitions. [2025-03-17 06:03:31,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 06:03:31,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:31,438 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:03:31,454 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 (6)] Ended with exit code 0 [2025-03-17 06:03:31,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-17 06:03:31,638 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:31,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:31,639 INFO L85 PathProgramCache]: Analyzing trace with hash -27924713, now seen corresponding path program 1 times [2025-03-17 06:03:31,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:03:31,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222663480] [2025-03-17 06:03:31,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:31,639 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-17 06:03:31,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:03:31,641 INFO L229 MonitoredProcess]: Starting monitored process 7 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-17 06:03:31,642 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 (7)] Waiting until timeout for monitored process [2025-03-17 06:03:31,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 06:03:32,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 06:03:32,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:32,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:32,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:03:32,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:03:32,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:32,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-17 06:03:32,451 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-03-17 06:03:32,451 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:03:32,451 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:03:32,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222663480] [2025-03-17 06:03:32,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222663480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:32,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:32,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:03:32,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783632660] [2025-03-17 06:03:32,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:32,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:03:32,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:03:32,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:03:32,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:03:32,453 INFO L87 Difference]: Start difference. First operand 117 states and 167 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:03:39,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:03:41,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:03:46,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:03:47,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:47,264 INFO L93 Difference]: Finished difference Result 234 states and 334 transitions. [2025-03-17 06:03:47,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:03:47,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 151 [2025-03-17 06:03:47,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:47,266 INFO L225 Difference]: With dead ends: 234 [2025-03-17 06:03:47,266 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 06:03:47,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:03:47,266 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 130 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:47,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 449 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 2 Unknown, 0 Unchecked, 14.7s Time] [2025-03-17 06:03:47,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 06:03:47,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2025-03-17 06:03:47,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 97 states have internal predecessors, (130), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:03:47,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 166 transitions. [2025-03-17 06:03:47,278 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 166 transitions. Word has length 151 [2025-03-17 06:03:47,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:47,278 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 166 transitions. [2025-03-17 06:03:47,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-17 06:03:47,278 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 166 transitions. [2025-03-17 06:03:47,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-17 06:03:47,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:47,280 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:03:47,297 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 (7)] Ended with exit code 0 [2025-03-17 06:03:47,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-17 06:03:47,481 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:47,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:47,482 INFO L85 PathProgramCache]: Analyzing trace with hash -466279430, now seen corresponding path program 1 times [2025-03-17 06:03:47,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:03:47,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702986357] [2025-03-17 06:03:47,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:47,482 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-17 06:03:47,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:03:47,485 INFO L229 MonitoredProcess]: Starting monitored process 8 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-17 06:03:47,486 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 (8)] Waiting until timeout for monitored process [2025-03-17 06:03:47,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 06:03:47,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 06:03:47,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:47,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:47,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 06:03:47,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:03:47,988 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2025-03-17 06:03:47,988 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:03:47,988 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:03:47,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702986357] [2025-03-17 06:03:47,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702986357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:47,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:47,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:03:47,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359723558] [2025-03-17 06:03:47,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:47,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:03:47,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:03:47,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:03:47,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:03:47,990 INFO L87 Difference]: Start difference. First operand 117 states and 166 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 06:03:48,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:48,325 INFO L93 Difference]: Finished difference Result 237 states and 336 transitions. [2025-03-17 06:03:48,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:03:48,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 153 [2025-03-17 06:03:48,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:48,327 INFO L225 Difference]: With dead ends: 237 [2025-03-17 06:03:48,327 INFO L226 Difference]: Without dead ends: 119 [2025-03-17 06:03:48,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:03:48,328 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:48,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 657 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:03:48,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-17 06:03:48,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2025-03-17 06:03:48,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.3298969072164948) internal successors, (129), 97 states have internal predecessors, (129), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 06:03:48,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 165 transitions. [2025-03-17 06:03:48,336 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 165 transitions. Word has length 153 [2025-03-17 06:03:48,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:48,336 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 165 transitions. [2025-03-17 06:03:48,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-17 06:03:48,336 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 165 transitions. [2025-03-17 06:03:48,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-17 06:03:48,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:48,338 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 06:03:48,358 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 (8)] Ended with exit code 0 [2025-03-17 06:03:48,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-17 06:03:48,539 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:48,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:48,540 INFO L85 PathProgramCache]: Analyzing trace with hash -525500167, now seen corresponding path program 1 times [2025-03-17 06:03:48,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:03:48,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2019017177] [2025-03-17 06:03:48,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:48,541 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-17 06:03:48,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:03:48,543 INFO L229 MonitoredProcess]: Starting monitored process 9 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-17 06:03:48,544 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 (9)] Waiting until timeout for monitored process [2025-03-17 06:03:48,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-17 06:03:49,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-17 06:03:49,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:49,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:49,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 06:03:49,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:03:49,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 06:03:50,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:50,236 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 138 treesize of output 69 [2025-03-17 06:03:54,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:54,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 82