./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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-74.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 e8eac1f6ce4b453c986bcf223e7a999b8cc2242bbb25b7afe262387bc06640cd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:50:53,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:50:53,081 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:50:53,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:50:53,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:50:53,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:50:53,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:50:53,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:50:53,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:50:53,122 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:50:53,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:50:53,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:50:53,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:50:53,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:50:53,125 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:50:53,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:50:53,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:50:53,126 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:50:53,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:50:53,127 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:50:53,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:50:53,128 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:50:53,129 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:50:53,129 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:50:53,129 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:50:53,129 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:50:53,130 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:50:53,130 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:50:53,130 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:50:53,130 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:50:53,130 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:50:53,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:50:53,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:50:53,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:50:53,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:50:53,132 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:50:53,132 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:50:53,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:50:53,133 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:50:53,133 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:50:53,133 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:50:53,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:50:53,136 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> e8eac1f6ce4b453c986bcf223e7a999b8cc2242bbb25b7afe262387bc06640cd [2024-11-10 09:50:53,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:50:53,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:50:53,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:50:53,399 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:50:53,399 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:50:53,400 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-74.i [2024-11-10 09:50:54,866 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:50:55,090 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:50:55,092 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-74.i [2024-11-10 09:50:55,102 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2816eb839/1413adb2a6aa4acba14b52e71953a2f9/FLAG251a12316 [2024-11-10 09:50:55,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2816eb839/1413adb2a6aa4acba14b52e71953a2f9 [2024-11-10 09:50:55,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:50:55,435 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:50:55,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:50:55,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:50:55,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:50:55,442 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:50:55" (1/1) ... [2024-11-10 09:50:55,443 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d6bca15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:55, skipping insertion in model container [2024-11-10 09:50:55,443 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:50:55" (1/1) ... [2024-11-10 09:50:55,471 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:50:55,642 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-74.i[916,929] [2024-11-10 09:50:55,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:50:55,707 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:50:55,719 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-74.i[916,929] [2024-11-10 09:50:55,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:50:55,810 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:50:55,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:55 WrapperNode [2024-11-10 09:50:55,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:50:55,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:50:55,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:50:55,812 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:50:55,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:55" (1/1) ... [2024-11-10 09:50:55,833 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:55" (1/1) ... [2024-11-10 09:50:55,875 INFO L138 Inliner]: procedures = 30, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 577 [2024-11-10 09:50:55,875 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:50:55,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:50:55,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:50:55,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:50:55,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:55" (1/1) ... [2024-11-10 09:50:55,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:55" (1/1) ... [2024-11-10 09:50:55,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:55" (1/1) ... [2024-11-10 09:50:55,907 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-10 09:50:55,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:55" (1/1) ... [2024-11-10 09:50:55,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:55" (1/1) ... [2024-11-10 09:50:55,941 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:55" (1/1) ... [2024-11-10 09:50:55,942 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:55" (1/1) ... [2024-11-10 09:50:55,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:55" (1/1) ... [2024-11-10 09:50:55,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:55" (1/1) ... [2024-11-10 09:50:55,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:50:55,983 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:50:55,983 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:50:55,983 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:50:55,984 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:55" (1/1) ... [2024-11-10 09:50:55,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:50:56,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:50:56,065 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) [2024-11-10 09:50:56,069 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 [2024-11-10 09:50:56,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:50:56,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-10 09:50:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-10 09:50:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 09:50:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-10 09:50:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-10 09:50:56,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 09:50:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:50:56,117 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:50:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 09:50:56,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:50:56,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:50:56,243 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:50:56,245 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:50:56,872 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem111#1;havoc property_#t~ite118#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite116#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem117#1;havoc property_#t~mem119#1;havoc property_#t~ite141#1;havoc property_#t~mem127#1;havoc property_#t~mem122#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~mem130#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite140#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~ite137#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~ite150#1;havoc property_#t~mem145#1;havoc property_#t~mem144#1;havoc property_#t~mem149#1;havoc property_#t~mem147#1;havoc property_#t~mem146#1;havoc property_#t~short148#1;havoc property_#t~short151#1;havoc property_#t~mem152#1;havoc property_#t~mem153#1;havoc property_#t~short154#1;havoc property_#t~ite164#1;havoc property_#t~mem156#1;havoc property_#t~mem155#1;havoc property_#t~ite161#1;havoc property_#t~mem158#1;havoc property_#t~mem157#1;havoc property_#t~mem160#1;havoc property_#t~mem159#1;havoc property_#t~mem163#1;havoc property_#t~mem162#1;havoc property_#t~short165#1; [2024-11-10 09:50:56,937 INFO L? ?]: Removed 150 outVars from TransFormulas that were not future-live. [2024-11-10 09:50:56,938 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:50:56,953 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:50:56,953 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:50:56,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:50:56 BoogieIcfgContainer [2024-11-10 09:50:56,954 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:50:56,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:50:56,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:50:56,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:50:56,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:50:55" (1/3) ... [2024-11-10 09:50:56,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd57b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:50:56, skipping insertion in model container [2024-11-10 09:50:56,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:50:55" (2/3) ... [2024-11-10 09:50:56,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd57b60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:50:56, skipping insertion in model container [2024-11-10 09:50:56,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:50:56" (3/3) ... [2024-11-10 09:50:56,964 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-74.i [2024-11-10 09:50:56,982 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:50:56,982 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:50:57,053 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:50:57,060 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;@1254087c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:50:57,061 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:50:57,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 108 states have (on average 1.4259259259259258) internal successors, (154), 109 states have internal predecessors, (154), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:50:57,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:50:57,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:50:57,080 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:50:57,080 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:50:57,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:50:57,087 INFO L85 PathProgramCache]: Analyzing trace with hash -508109314, now seen corresponding path program 1 times [2024-11-10 09:50:57,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:50:57,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849866796] [2024-11-10 09:50:57,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:50:57,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:50:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:50:57,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:50:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:50:57,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:50:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:50:57,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:50:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:50:57,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:50:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:50:57,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:50:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:50:57,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:50:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:50:57,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:50:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:50:57,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:50:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:50:57,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:50:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:50:57,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:50:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:50:57,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:50:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:50:57,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:50:57,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:50:57,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:50:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:50:57,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:50:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:50:57,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:50:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:50:57,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 09:50:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:50:57,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 09:50:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:50:57,582 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:50:57,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:50:57,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849866796] [2024-11-10 09:50:57,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849866796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:50:57,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:50:57,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:50:57,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272330147] [2024-11-10 09:50:57,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:50:57,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:50:57,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:50:57,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:50:57,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:50:57,618 INFO L87 Difference]: Start difference. First operand has 128 states, 108 states have (on average 1.4259259259259258) internal successors, (154), 109 states have internal predecessors, (154), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:50:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:50:57,676 INFO L93 Difference]: Finished difference Result 248 states and 386 transitions. [2024-11-10 09:50:57,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:50:57,679 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 152 [2024-11-10 09:50:57,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:50:57,688 INFO L225 Difference]: With dead ends: 248 [2024-11-10 09:50:57,688 INFO L226 Difference]: Without dead ends: 123 [2024-11-10 09:50:57,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:50:57,696 INFO L432 NwaCegarLoop]: 180 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, 180 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 [2024-11-10 09:50:57,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:50:57,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-10 09:50:57,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-10 09:50:57,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 104 states have internal predecessors, (146), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:50:57,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 180 transitions. [2024-11-10 09:50:57,767 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 180 transitions. Word has length 152 [2024-11-10 09:50:57,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:50:57,767 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 180 transitions. [2024-11-10 09:50:57,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:50:57,768 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 180 transitions. [2024-11-10 09:50:57,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:50:57,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:50:57,772 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:50:57,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:50:57,772 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:50:57,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:50:57,773 INFO L85 PathProgramCache]: Analyzing trace with hash -115667397, now seen corresponding path program 1 times [2024-11-10 09:50:57,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:50:57,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666865248] [2024-11-10 09:50:57,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:50:57,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:50:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:51:00,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-10 09:51:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:51:00,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 09:51:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:51:00,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 09:51:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:51:00,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-10 09:51:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:51:00,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-10 09:51:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:51:00,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-10 09:51:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:51:00,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-10 09:51:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:51:00,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 09:51:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:51:00,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 09:51:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:51:00,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 09:51:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:51:00,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 09:51:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:51:00,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 09:51:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:51:00,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 09:51:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:51:00,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 09:51:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:51:00,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 09:51:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:51:00,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 09:51:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:51:00,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 09:51:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:51:00,697 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:51:00,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:51:00,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666865248] [2024-11-10 09:51:00,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666865248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:51:00,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:51:00,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 09:51:00,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521286179] [2024-11-10 09:51:00,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:51:00,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 09:51:00,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:51:00,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 09:51:00,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:51:00,703 INFO L87 Difference]: Start difference. First operand 123 states and 180 transitions. Second operand has 9 states, 8 states have (on average 8.75) internal successors, (70), 9 states have internal predecessors, (70), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:51:01,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:51:01,701 INFO L93 Difference]: Finished difference Result 315 states and 459 transitions. [2024-11-10 09:51:01,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 09:51:01,701 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 9 states have internal predecessors, (70), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 152 [2024-11-10 09:51:01,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:51:01,704 INFO L225 Difference]: With dead ends: 315 [2024-11-10 09:51:01,704 INFO L226 Difference]: Without dead ends: 195 [2024-11-10 09:51:01,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-10 09:51:01,706 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 91 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 09:51:01,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1202 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 09:51:01,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-10 09:51:01,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 191. [2024-11-10 09:51:01,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 167 states have (on average 1.4131736526946108) internal successors, (236), 168 states have internal predecessors, (236), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:51:01,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 278 transitions. [2024-11-10 09:51:01,735 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 278 transitions. Word has length 152 [2024-11-10 09:51:01,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:51:01,736 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 278 transitions. [2024-11-10 09:51:01,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 9 states have internal predecessors, (70), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:51:01,737 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 278 transitions. [2024-11-10 09:51:01,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:51:01,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:51:01,741 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:51:01,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:51:01,742 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:51:01,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:51:01,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1912618756, now seen corresponding path program 1 times [2024-11-10 09:51:01,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:51:01,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939025889] [2024-11-10 09:51:01,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:51:01,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:51:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:51:01,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:51:01,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:51:02,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:51:02,035 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:51:02,036 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:51:02,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 09:51:02,042 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-10 09:51:02,124 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:51:02,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:51:02 BoogieIcfgContainer [2024-11-10 09:51:02,130 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:51:02,131 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:51:02,131 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:51:02,131 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:51:02,132 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:50:56" (3/4) ... [2024-11-10 09:51:02,135 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:51:02,136 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:51:02,137 INFO L158 Benchmark]: Toolchain (without parser) took 6701.64ms. Allocated memory was 167.8MB in the beginning and 241.2MB in the end (delta: 73.4MB). Free memory was 97.8MB in the beginning and 162.8MB in the end (delta: -65.0MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2024-11-10 09:51:02,137 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:51:02,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.54ms. Allocated memory is still 167.8MB. Free memory was 97.6MB in the beginning and 78.6MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 09:51:02,141 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.22ms. Allocated memory is still 167.8MB. Free memory was 78.6MB in the beginning and 74.3MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 09:51:02,141 INFO L158 Benchmark]: Boogie Preprocessor took 106.23ms. Allocated memory is still 167.8MB. Free memory was 74.3MB in the beginning and 139.2MB in the end (delta: -64.8MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-11-10 09:51:02,141 INFO L158 Benchmark]: IcfgBuilder took 970.87ms. Allocated memory is still 167.8MB. Free memory was 139.2MB in the beginning and 102.0MB in the end (delta: 37.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-10 09:51:02,142 INFO L158 Benchmark]: TraceAbstraction took 5174.63ms. Allocated memory was 167.8MB in the beginning and 241.2MB in the end (delta: 73.4MB). Free memory was 101.4MB in the beginning and 163.9MB in the end (delta: -62.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 09:51:02,142 INFO L158 Benchmark]: Witness Printer took 4.88ms. Allocated memory is still 241.2MB. Free memory was 163.9MB in the beginning and 162.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:51:02,144 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.18ms. Allocated memory is still 113.2MB. Free memory is still 73.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.54ms. Allocated memory is still 167.8MB. Free memory was 97.6MB in the beginning and 78.6MB in the end (delta: 19.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.22ms. Allocated memory is still 167.8MB. Free memory was 78.6MB in the beginning and 74.3MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.23ms. Allocated memory is still 167.8MB. Free memory was 74.3MB in the beginning and 139.2MB in the end (delta: -64.8MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * IcfgBuilder took 970.87ms. Allocated memory is still 167.8MB. Free memory was 139.2MB in the beginning and 102.0MB in the end (delta: 37.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5174.63ms. Allocated memory was 167.8MB in the beginning and 241.2MB in the end (delta: 73.4MB). Free memory was 101.4MB in the beginning and 163.9MB in the end (delta: -62.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Witness Printer took 4.88ms. Allocated memory is still 241.2MB. Free memory was 163.9MB in the beginning and 162.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 123. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 25, 63.25, 3.779, 31.6, 100.5, 64, 3150951169, 128, 1, 1, 9.3, 0, 1, 1 }; [L55] unsigned char last_1_WrapperStruct00_var_1_16 = 1; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_16=1] [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] CALL updateLastVariables() [L120] EXPR WrapperStruct00.var_1_16 [L120] last_1_WrapperStruct00_var_1_16 = WrapperStruct00.var_1_16 [L130] RET updateLastVariables() [L131] CALL updateVariables() [L90] WrapperStruct00.var_1_2 = __VERIFIER_nondet_double() [L91] EXPR WrapperStruct00.var_1_2 [L91] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L91] EXPR WrapperStruct00.var_1_2 [L91] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L91] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L91] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L91] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L92] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double() [L93] EXPR WrapperStruct00.var_1_3 [L93] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L93] EXPR WrapperStruct00.var_1_3 [L93] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L93] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L93] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L93] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L94] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L95] EXPR WrapperStruct00.var_1_4 [L95] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_4 [L95] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L95] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L96] WrapperStruct00.var_1_5 = __VERIFIER_nondet_double() [L97] EXPR WrapperStruct00.var_1_5 [L97] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F [L97] EXPR WrapperStruct00.var_1_5 [L97] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L97] EXPR (WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L97] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L97] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L98] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ulong() [L99] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L100] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L101] WrapperStruct00.var_1_7 = __VERIFIER_nondet_ulong() [L102] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L103] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L104] WrapperStruct00.var_1_8 = __VERIFIER_nondet_ulong() [L105] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L106] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L107] WrapperStruct00.var_1_9 = __VERIFIER_nondet_ulong() [L108] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L109] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L110] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L111] EXPR WrapperStruct00.var_1_11 [L111] EXPR WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_11 [L111] EXPR WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L111] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L112] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L113] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L114] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L115] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L116] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L117] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L131] RET updateVariables() [L132] CALL step() [L59] unsigned char stepLocal_0 = last_1_WrapperStruct00_var_1_16 && last_1_WrapperStruct00_var_1_16; [L60] EXPR WrapperStruct00.var_1_5 [L60] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1, stepLocal_0=1] [L60] COND TRUE (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_11) || stepLocal_0 [L61] EXPR WrapperStruct00.var_1_14 [L61] WrapperStruct00.var_1_10 = WrapperStruct00.var_1_14 [L65] EXPR WrapperStruct00.var_1_10 [L65] unsigned char stepLocal_1 = WrapperStruct00.var_1_10; [L66] stepLocal_1 && WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L66] COND FALSE !(stepLocal_1 && WrapperStruct00.var_1_10) [L73] EXPR WrapperStruct00.var_1_15 [L73] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_15 [L75] EXPR WrapperStruct00.var_1_2 [L75] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L75] EXPR ((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) [L75] EXPR WrapperStruct00.var_1_2 [L75] EXPR ((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L75] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L75] EXPR ((((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) < (WrapperStruct00.var_1_4)) ? (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) : (WrapperStruct00.var_1_4) [L75] EXPR WrapperStruct00.var_1_4 [L75] EXPR ((((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) < (WrapperStruct00.var_1_4)) ? (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) : (WrapperStruct00.var_1_4) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L75] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L75] COND FALSE !(((((((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) < (WrapperStruct00.var_1_4)) ? (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) : (WrapperStruct00.var_1_4))) < WrapperStruct00.var_1_5) [L78] EXPR WrapperStruct00.var_1_2 [L78] EXPR WrapperStruct00.var_1_3 [L78] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L78] COND FALSE !(WrapperStruct00.var_1_2 >= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_5)) [L85] EXPR WrapperStruct00.var_1_6 [L85] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_6 [L132] RET step() [L133] CALL, EXPR property() [L123] EXPR WrapperStruct00.var_1_2 [L123] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L123] EXPR ((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) [L123] EXPR WrapperStruct00.var_1_2 [L123] EXPR ((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L123] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L123] EXPR ((((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) < (WrapperStruct00.var_1_4)) ? (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) : (WrapperStruct00.var_1_4) [L123] EXPR WrapperStruct00.var_1_4 [L123] EXPR ((((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) < (WrapperStruct00.var_1_4)) ? (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) : (WrapperStruct00.var_1_4) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L123] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L123] EXPR (((((((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) < (WrapperStruct00.var_1_4)) ? (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) : (WrapperStruct00.var_1_4))) < WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned long int) ((((WrapperStruct00.var_1_6) > ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8))) ? (WrapperStruct00.var_1_6) : ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)))))) : ((WrapperStruct00.var_1_2 >= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_5)) ? ((WrapperStruct00.var_1_4 > (- WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_6))) [L123] EXPR WrapperStruct00.var_1_1 [L123] EXPR WrapperStruct00.var_1_6 [L123] EXPR WrapperStruct00.var_1_7 [L123] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L123] EXPR ((WrapperStruct00.var_1_6) > ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8))) ? (WrapperStruct00.var_1_6) : ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) [L123] EXPR WrapperStruct00.var_1_7 [L123] EXPR WrapperStruct00.var_1_8 [L123] EXPR ((WrapperStruct00.var_1_6) > ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8))) ? (WrapperStruct00.var_1_6) : ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L123] EXPR (((((((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) < (WrapperStruct00.var_1_4)) ? (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) : (WrapperStruct00.var_1_4))) < WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned long int) ((((WrapperStruct00.var_1_6) > ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8))) ? (WrapperStruct00.var_1_6) : ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)))))) : ((WrapperStruct00.var_1_2 >= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_5)) ? ((WrapperStruct00.var_1_4 > (- WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_6))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L123] EXPR ((((((((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) < (WrapperStruct00.var_1_4)) ? (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) : (WrapperStruct00.var_1_4))) < WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned long int) ((((WrapperStruct00.var_1_6) > ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8))) ? (WrapperStruct00.var_1_6) : ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)))))) : ((WrapperStruct00.var_1_2 >= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_5)) ? ((WrapperStruct00.var_1_4 > (- WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_6)))) && (((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_11) || (last_1_WrapperStruct00_var_1_16 && last_1_WrapperStruct00_var_1_16)) ? (WrapperStruct00.var_1_10 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_10 == ((unsigned char) (WrapperStruct00.var_1_14 && (! WrapperStruct00.var_1_15))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L123] EXPR (((((((((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) < (WrapperStruct00.var_1_4)) ? (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) : (WrapperStruct00.var_1_4))) < WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned long int) ((((WrapperStruct00.var_1_6) > ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8))) ? (WrapperStruct00.var_1_6) : ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)))))) : ((WrapperStruct00.var_1_2 >= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_5)) ? ((WrapperStruct00.var_1_4 > (- WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_6)))) && (((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_11) || (last_1_WrapperStruct00_var_1_16 && last_1_WrapperStruct00_var_1_16)) ? (WrapperStruct00.var_1_10 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_10 == ((unsigned char) (WrapperStruct00.var_1_14 && (! WrapperStruct00.var_1_15)))))) && ((WrapperStruct00.var_1_10 && WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_4 < (- WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L123-L124] return (((((((((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) < (WrapperStruct00.var_1_4)) ? (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) : (WrapperStruct00.var_1_4))) < WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned long int) ((((WrapperStruct00.var_1_6) > ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8))) ? (WrapperStruct00.var_1_6) : ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)))))) : ((WrapperStruct00.var_1_2 >= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_5)) ? ((WrapperStruct00.var_1_4 > (- WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_6)))) && (((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_11) || (last_1_WrapperStruct00_var_1_16 && last_1_WrapperStruct00_var_1_16)) ? (WrapperStruct00.var_1_10 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_10 == ((unsigned char) (WrapperStruct00.var_1_14 && (! WrapperStruct00.var_1_15)))))) && ((WrapperStruct00.var_1_10 && WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_4 < (- WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_15))) ; [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 3, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 92 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 91 mSDsluCounter, 1382 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1020 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 585 IncrementalHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 362 mSDtfsCounter, 585 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=2, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 302 ConstructedInterpolants, 0 QuantifiedInterpolants, 626 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1088/1088 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 09:51:02,184 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/11.0.12-open/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.5.800.v20200727-1323.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-74.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 e8eac1f6ce4b453c986bcf223e7a999b8cc2242bbb25b7afe262387bc06640cd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:51:04,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:51:04,514 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:51:04,520 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:51:04,520 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:51:04,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:51:04,552 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:51:04,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:51:04,553 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:51:04,557 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:51:04,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:51:04,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:51:04,558 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:51:04,561 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:51:04,561 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:51:04,561 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:51:04,562 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:51:04,562 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:51:04,562 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:51:04,562 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:51:04,562 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:51:04,563 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:51:04,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:51:04,564 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:51:04,564 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:51:04,565 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:51:04,565 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:51:04,565 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:51:04,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:51:04,565 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:51:04,566 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:51:04,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:51:04,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:51:04,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:51:04,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:51:04,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:51:04,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:51:04,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:51:04,569 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:51:04,569 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:51:04,570 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:51:04,570 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:51:04,570 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:51:04,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:51:04,570 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> e8eac1f6ce4b453c986bcf223e7a999b8cc2242bbb25b7afe262387bc06640cd [2024-11-10 09:51:04,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:51:04,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:51:04,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:51:04,909 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:51:04,909 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:51:04,910 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-74.i [2024-11-10 09:51:06,507 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:51:06,734 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:51:06,735 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-74.i [2024-11-10 09:51:06,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92905019f/cbee8416d91743088717e670689b75c6/FLAG63ea4ddfd [2024-11-10 09:51:07,087 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92905019f/cbee8416d91743088717e670689b75c6 [2024-11-10 09:51:07,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:51:07,093 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:51:07,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:51:07,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:51:07,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:51:07,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:51:07" (1/1) ... [2024-11-10 09:51:07,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70a8fc9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:07, skipping insertion in model container [2024-11-10 09:51:07,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:51:07" (1/1) ... [2024-11-10 09:51:07,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:51:07,336 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-74.i[916,929] [2024-11-10 09:51:07,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:51:07,430 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:51:07,442 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-74.i[916,929] [2024-11-10 09:51:07,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:51:07,543 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:51:07,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:07 WrapperNode [2024-11-10 09:51:07,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:51:07,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:51:07,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:51:07,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:51:07,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:07" (1/1) ... [2024-11-10 09:51:07,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:07" (1/1) ... [2024-11-10 09:51:07,626 INFO L138 Inliner]: procedures = 34, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 576 [2024-11-10 09:51:07,626 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:51:07,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:51:07,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:51:07,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:51:07,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:07" (1/1) ... [2024-11-10 09:51:07,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:07" (1/1) ... [2024-11-10 09:51:07,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:07" (1/1) ... [2024-11-10 09:51:07,691 INFO L175 MemorySlicer]: Split 153 memory accesses to 2 slices as follows [2, 151]. 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]. [2024-11-10 09:51:07,692 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:07" (1/1) ... [2024-11-10 09:51:07,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:07" (1/1) ... [2024-11-10 09:51:07,725 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:07" (1/1) ... [2024-11-10 09:51:07,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:07" (1/1) ... [2024-11-10 09:51:07,732 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:07" (1/1) ... [2024-11-10 09:51:07,740 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:07" (1/1) ... [2024-11-10 09:51:07,749 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:51:07,752 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:51:07,753 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:51:07,753 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:51:07,753 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:07" (1/1) ... [2024-11-10 09:51:07,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:51:07,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:51:07,785 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) [2024-11-10 09:51:07,793 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 [2024-11-10 09:51:07,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:51:07,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-10 09:51:07,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-10 09:51:07,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-10 09:51:07,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-10 09:51:07,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-10 09:51:07,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-10 09:51:07,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 09:51:07,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 09:51:07,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:51:07,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 09:51:07,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 09:51:07,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 09:51:07,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-10 09:51:07,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-10 09:51:07,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-10 09:51:07,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-10 09:51:07,835 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:51:07,835 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:51:07,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:51:07,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:51:07,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-10 09:51:07,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-10 09:51:07,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 09:51:07,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 09:51:08,012 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:51:08,014 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:51:09,873 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem111#1;havoc property_#t~ite118#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite116#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem117#1;havoc property_#t~mem119#1;havoc property_#t~ite141#1;havoc property_#t~mem127#1;havoc property_#t~mem122#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~mem130#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite140#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~ite137#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~ite150#1;havoc property_#t~mem145#1;havoc property_#t~mem144#1;havoc property_#t~mem149#1;havoc property_#t~mem147#1;havoc property_#t~mem146#1;havoc property_#t~short148#1;havoc property_#t~short151#1;havoc property_#t~mem152#1;havoc property_#t~mem153#1;havoc property_#t~short154#1;havoc property_#t~ite164#1;havoc property_#t~mem156#1;havoc property_#t~mem155#1;havoc property_#t~ite161#1;havoc property_#t~mem158#1;havoc property_#t~mem157#1;havoc property_#t~mem160#1;havoc property_#t~mem159#1;havoc property_#t~mem163#1;havoc property_#t~mem162#1;havoc property_#t~short165#1; [2024-11-10 09:51:09,935 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2024-11-10 09:51:09,935 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:51:09,958 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:51:09,959 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:51:09,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:51:09 BoogieIcfgContainer [2024-11-10 09:51:09,959 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:51:09,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:51:09,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:51:09,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:51:09,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:51:07" (1/3) ... [2024-11-10 09:51:09,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb84c3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:51:09, skipping insertion in model container [2024-11-10 09:51:09,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:51:07" (2/3) ... [2024-11-10 09:51:09,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb84c3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:51:09, skipping insertion in model container [2024-11-10 09:51:09,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:51:09" (3/3) ... [2024-11-10 09:51:09,973 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-74.i [2024-11-10 09:51:09,988 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:51:09,988 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:51:10,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:51:10,065 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;@5f2622d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:51:10,066 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:51:10,072 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 108 states have (on average 1.4259259259259258) internal successors, (154), 109 states have internal predecessors, (154), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:51:10,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:51:10,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:51:10,106 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:51:10,107 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:51:10,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:51:10,113 INFO L85 PathProgramCache]: Analyzing trace with hash 67116353, now seen corresponding path program 1 times [2024-11-10 09:51:10,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:51:10,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861797865] [2024-11-10 09:51:10,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:51:10,133 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 [2024-11-10 09:51:10,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:51:10,137 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) [2024-11-10 09:51:10,143 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 [2024-11-10 09:51:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:51:10,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:51:10,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:51:10,801 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-10 09:51:10,804 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:51:10,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:51:10,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861797865] [2024-11-10 09:51:10,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [861797865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:51:10,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:51:10,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:51:10,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651109641] [2024-11-10 09:51:10,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:51:10,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:51:10,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:51:10,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:51:10,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:51:10,838 INFO L87 Difference]: Start difference. First operand has 128 states, 108 states have (on average 1.4259259259259258) internal successors, (154), 109 states have internal predecessors, (154), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:51:10,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:51:10,867 INFO L93 Difference]: Finished difference Result 248 states and 386 transitions. [2024-11-10 09:51:10,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:51:10,869 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 152 [2024-11-10 09:51:10,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:51:10,876 INFO L225 Difference]: With dead ends: 248 [2024-11-10 09:51:10,876 INFO L226 Difference]: Without dead ends: 123 [2024-11-10 09:51:10,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:51:10,882 INFO L432 NwaCegarLoop]: 180 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, 180 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 [2024-11-10 09:51:10,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:51:10,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-10 09:51:10,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-10 09:51:10,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 104 states have internal predecessors, (146), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:51:10,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 180 transitions. [2024-11-10 09:51:10,924 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 180 transitions. Word has length 152 [2024-11-10 09:51:10,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:51:10,924 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 180 transitions. [2024-11-10 09:51:10,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-10 09:51:10,925 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 180 transitions. [2024-11-10 09:51:10,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:51:10,928 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:51:10,929 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:51:10,944 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 [2024-11-10 09:51:11,129 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 [2024-11-10 09:51:11,130 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:51:11,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:51:11,131 INFO L85 PathProgramCache]: Analyzing trace with hash 459558270, now seen corresponding path program 1 times [2024-11-10 09:51:11,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:51:11,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192704922] [2024-11-10 09:51:11,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:51:11,132 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 [2024-11-10 09:51:11,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:51:11,136 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) [2024-11-10 09:51:11,137 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 [2024-11-10 09:51:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:51:11,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 09:51:11,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:51:11,866 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:51:11,867 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:51:11,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:51:11,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192704922] [2024-11-10 09:51:11,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192704922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:51:11,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:51:11,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 09:51:11,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053948223] [2024-11-10 09:51:11,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:51:11,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 09:51:11,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:51:11,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 09:51:11,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 09:51:11,881 INFO L87 Difference]: Start difference. First operand 123 states and 180 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:51:13,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:51:13,699 INFO L93 Difference]: Finished difference Result 244 states and 359 transitions. [2024-11-10 09:51:13,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 09:51:13,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2024-11-10 09:51:13,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:51:13,705 INFO L225 Difference]: With dead ends: 244 [2024-11-10 09:51:13,705 INFO L226 Difference]: Without dead ends: 124 [2024-11-10 09:51:13,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 09:51:13,708 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 09:51:13,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 438 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 09:51:13,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-10 09:51:13,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-10 09:51:13,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 105 states have (on average 1.4) internal successors, (147), 105 states have internal predecessors, (147), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 09:51:13,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 181 transitions. [2024-11-10 09:51:13,721 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 181 transitions. Word has length 152 [2024-11-10 09:51:13,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:51:13,722 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 181 transitions. [2024-11-10 09:51:13,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:51:13,723 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 181 transitions. [2024-11-10 09:51:13,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:51:13,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:51:13,726 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:51:13,743 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-10 09:51:13,926 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 [2024-11-10 09:51:13,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:51:13,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:51:13,927 INFO L85 PathProgramCache]: Analyzing trace with hash 490578077, now seen corresponding path program 1 times [2024-11-10 09:51:13,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:51:13,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826466647] [2024-11-10 09:51:13,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:51:13,929 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 [2024-11-10 09:51:13,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:51:13,933 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) [2024-11-10 09:51:13,934 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 [2024-11-10 09:51:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:51:14,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 09:51:14,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:51:14,629 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 [2024-11-10 09:51:14,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2024-11-10 09:51:14,725 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:51:14,727 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:51:14,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:51:14,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826466647] [2024-11-10 09:51:14,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826466647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:51:14,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:51:14,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 09:51:14,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497327192] [2024-11-10 09:51:14,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:51:14,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 09:51:14,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:51:14,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 09:51:14,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 09:51:14,732 INFO L87 Difference]: Start difference. First operand 124 states and 181 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:51:15,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:51:17,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:51:17,331 INFO L93 Difference]: Finished difference Result 317 states and 461 transitions. [2024-11-10 09:51:17,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 09:51:17,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2024-11-10 09:51:17,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:51:17,335 INFO L225 Difference]: With dead ends: 317 [2024-11-10 09:51:17,335 INFO L226 Difference]: Without dead ends: 196 [2024-11-10 09:51:17,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 09:51:17,339 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 90 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-10 09:51:17,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 811 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-10 09:51:17,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-10 09:51:17,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 192. [2024-11-10 09:51:17,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 168 states have (on average 1.4107142857142858) internal successors, (237), 169 states have internal predecessors, (237), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:51:17,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 279 transitions. [2024-11-10 09:51:17,356 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 279 transitions. Word has length 152 [2024-11-10 09:51:17,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:51:17,357 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 279 transitions. [2024-11-10 09:51:17,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:51:17,357 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 279 transitions. [2024-11-10 09:51:17,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:51:17,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:51:17,360 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:51:17,377 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 [2024-11-10 09:51:17,560 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 [2024-11-10 09:51:17,561 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:51:17,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:51:17,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1863762048, now seen corresponding path program 1 times [2024-11-10 09:51:17,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:51:17,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055728234] [2024-11-10 09:51:17,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:51:17,563 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 [2024-11-10 09:51:17,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:51:17,566 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) [2024-11-10 09:51:17,567 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 [2024-11-10 09:51:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:51:18,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 09:51:18,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:51:18,192 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 [2024-11-10 09:51:18,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2024-11-10 09:51:18,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:51:18,264 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 30 treesize of output 10 [2024-11-10 09:51:18,315 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-10 09:51:18,315 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:51:18,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:51:18,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055728234] [2024-11-10 09:51:18,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055728234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:51:18,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:51:18,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 09:51:18,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367103643] [2024-11-10 09:51:18,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:51:18,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 09:51:18,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:51:18,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 09:51:18,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 09:51:18,318 INFO L87 Difference]: Start difference. First operand 192 states and 279 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:51:20,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-10 09:51:21,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:51:21,816 INFO L93 Difference]: Finished difference Result 388 states and 562 transitions. [2024-11-10 09:51:21,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 09:51:21,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 152 [2024-11-10 09:51:21,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:51:21,819 INFO L225 Difference]: With dead ends: 388 [2024-11-10 09:51:21,820 INFO L226 Difference]: Without dead ends: 199 [2024-11-10 09:51:21,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-10 09:51:21,821 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 90 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-10 09:51:21,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 856 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-10 09:51:21,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-10 09:51:21,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 193. [2024-11-10 09:51:21,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 169 states have (on average 1.4082840236686391) internal successors, (238), 170 states have internal predecessors, (238), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 09:51:21,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 280 transitions. [2024-11-10 09:51:21,841 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 280 transitions. Word has length 152 [2024-11-10 09:51:21,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:51:21,845 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 280 transitions. [2024-11-10 09:51:21,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-10 09:51:21,845 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 280 transitions. [2024-11-10 09:51:21,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 09:51:21,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:51:21,847 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 09:51:21,867 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 [2024-11-10 09:51:22,054 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 [2024-11-10 09:51:22,055 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:51:22,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:51:22,056 INFO L85 PathProgramCache]: Analyzing trace with hash 66810689, now seen corresponding path program 1 times [2024-11-10 09:51:22,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:51:22,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598052550] [2024-11-10 09:51:22,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:51:22,057 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 [2024-11-10 09:51:22,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:51:22,060 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) [2024-11-10 09:51:22,061 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 [2024-11-10 09:51:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:51:22,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-10 09:51:22,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:51:23,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2024-11-10 09:51:23,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 77 [2024-11-10 09:51:25,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 255 treesize of output 135 [2024-11-10 09:51:26,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 255 treesize of output 153 [2024-11-10 09:51:29,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:51:29,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 356 treesize of output 211 [2024-11-10 09:51:30,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:51:30,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 356 treesize of output 211 [2024-11-10 09:51:31,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:51:31,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 356 treesize of output 211 [2024-11-10 09:51:32,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:51:32,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 356 treesize of output 211 [2024-11-10 09:51:33,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:51:33,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 357 treesize of output 231 [2024-11-10 09:51:39,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:51:39,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 376 treesize of output 237 [2024-11-10 09:51:40,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:51:40,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 376 treesize of output 237 [2024-11-10 09:51:41,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:51:41,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 378 treesize of output 257 [2024-11-10 09:51:42,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:51:42,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 393 treesize of output 260 [2024-11-10 09:51:49,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 09:51:49,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 688 treesize of output 339 [2024-11-10 09:51:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-11-10 09:51:49,718 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:51:49,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:51:49,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598052550] [2024-11-10 09:51:49,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598052550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:51:49,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:51:49,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-11-10 09:51:49,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877031546] [2024-11-10 09:51:49,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:51:49,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-10 09:51:49,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:51:49,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-10 09:51:49,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=555, Unknown=1, NotChecked=0, Total=702 [2024-11-10 09:51:49,721 INFO L87 Difference]: Start difference. First operand 193 states and 280 transitions. Second operand has 27 states, 27 states have (on average 3.037037037037037) internal successors, (82), 26 states have internal predecessors, (82), 5 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-10 09:51:50,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 09:52:01,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 09:52:10,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 09:52:14,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 09:52:18,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-10 09:52:22,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]