./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/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/float-benchs/interpolation.c.v+cfa-reducer.c -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.graphml --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 a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 06:34:41,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 06:34:41,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 06:34:41,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 06:34:41,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 06:34:41,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 06:34:41,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 06:34:41,858 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 06:34:41,859 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 06:34:41,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 06:34:41,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 06:34:41,861 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 06:34:41,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 06:34:41,863 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 06:34:41,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 06:34:41,866 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 06:34:41,867 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 06:34:41,869 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 06:34:41,870 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 06:34:41,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 06:34:41,874 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 06:34:41,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 06:34:41,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 06:34:41,878 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 06:34:41,880 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 06:34:41,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 06:34:41,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 06:34:41,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 06:34:41,881 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 06:34:41,882 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 06:34:41,882 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 06:34:41,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 06:34:41,883 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 06:34:41,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 06:34:41,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 06:34:41,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 06:34:41,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 06:34:41,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 06:34:41,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 06:34:41,885 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 06:34:41,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 06:34:41,887 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 06:34:41,900 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 06:34:41,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 06:34:41,903 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 06:34:41,903 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 06:34:41,904 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 06:34:41,904 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 06:34:41,905 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 06:34:41,905 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 06:34:41,905 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 06:34:41,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 06:34:41,906 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 06:34:41,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 06:34:41,906 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 06:34:41,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 06:34:41,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 06:34:41,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 06:34:41,907 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 06:34:41,907 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 06:34:41,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 06:34:41,907 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 06:34:41,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 06:34:41,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 06:34:41,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 06:34:41,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 06:34:41,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 06:34:41,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 06:34:41,908 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 06:34:41,908 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 06:34:41,908 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 06:34:41,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 06:34:41,908 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 06:34:41,909 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 06:34:41,909 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 06:34:41,909 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 06:34:41,909 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 [2021-12-17 06:34:42,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 06:34:42,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 06:34:42,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 06:34:42,126 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 06:34:42,127 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 06:34:42,128 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2021-12-17 06:34:42,184 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f54530d3e/d6738592be754c4891903a71c723a9d5/FLAGa76c69af9 [2021-12-17 06:34:42,531 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 06:34:42,532 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2021-12-17 06:34:42,541 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f54530d3e/d6738592be754c4891903a71c723a9d5/FLAGa76c69af9 [2021-12-17 06:34:42,553 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f54530d3e/d6738592be754c4891903a71c723a9d5 [2021-12-17 06:34:42,555 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 06:34:42,560 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 06:34:42,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 06:34:42,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 06:34:42,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 06:34:42,565 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 06:34:42" (1/1) ... [2021-12-17 06:34:42,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@591a719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:42, skipping insertion in model container [2021-12-17 06:34:42,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 06:34:42" (1/1) ... [2021-12-17 06:34:42,571 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 06:34:42,582 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 06:34:42,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2021-12-17 06:34:42,702 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 06:34:42,709 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 06:34:42,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2021-12-17 06:34:42,743 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 06:34:42,754 INFO L208 MainTranslator]: Completed translation [2021-12-17 06:34:42,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:42 WrapperNode [2021-12-17 06:34:42,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 06:34:42,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 06:34:42,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 06:34:42,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 06:34:42,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:42" (1/1) ... [2021-12-17 06:34:42,772 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:42" (1/1) ... [2021-12-17 06:34:42,792 INFO L137 Inliner]: procedures = 18, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 108 [2021-12-17 06:34:42,792 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 06:34:42,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 06:34:42,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 06:34:42,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 06:34:42,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:42" (1/1) ... [2021-12-17 06:34:42,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:42" (1/1) ... [2021-12-17 06:34:42,803 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:42" (1/1) ... [2021-12-17 06:34:42,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:42" (1/1) ... [2021-12-17 06:34:42,813 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:42" (1/1) ... [2021-12-17 06:34:42,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:42" (1/1) ... [2021-12-17 06:34:42,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:42" (1/1) ... [2021-12-17 06:34:42,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 06:34:42,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 06:34:42,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 06:34:42,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 06:34:42,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:42" (1/1) ... [2021-12-17 06:34:42,834 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 06:34:42,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 06:34:42,851 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 06:34:42,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 06:34:42,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 06:34:42,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 06:34:42,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 06:34:42,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2021-12-17 06:34:42,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 06:34:42,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 06:34:42,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2021-12-17 06:34:42,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 06:34:42,928 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 06:34:42,930 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 06:34:43,090 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 06:34:43,094 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 06:34:43,094 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-17 06:34:43,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:34:43 BoogieIcfgContainer [2021-12-17 06:34:43,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 06:34:43,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 06:34:43,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 06:34:43,099 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 06:34:43,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 06:34:42" (1/3) ... [2021-12-17 06:34:43,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9d81f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 06:34:43, skipping insertion in model container [2021-12-17 06:34:43,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:42" (2/3) ... [2021-12-17 06:34:43,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e9d81f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 06:34:43, skipping insertion in model container [2021-12-17 06:34:43,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:34:43" (3/3) ... [2021-12-17 06:34:43,109 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+cfa-reducer.c [2021-12-17 06:34:43,113 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 06:34:43,113 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 06:34:43,169 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 06:34:43,183 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 06:34:43,198 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 06:34:43,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:34:43,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 06:34:43,221 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:34:43,222 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:34:43,222 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:34:43,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:34:43,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1718991182, now seen corresponding path program 1 times [2021-12-17 06:34:43,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 06:34:43,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369052705] [2021-12-17 06:34:43,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:34:43,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 06:34:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:34:43,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:34:43,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 06:34:43,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369052705] [2021-12-17 06:34:43,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369052705] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 06:34:43,431 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 06:34:43,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 06:34:43,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624964020] [2021-12-17 06:34:43,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 06:34:43,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 06:34:43,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 06:34:43,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 06:34:43,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 06:34:43,462 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:34:43,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:34:43,519 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2021-12-17 06:34:43,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 06:34:43,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-17 06:34:43,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:34:43,527 INFO L225 Difference]: With dead ends: 31 [2021-12-17 06:34:43,528 INFO L226 Difference]: Without dead ends: 15 [2021-12-17 06:34:43,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-17 06:34:43,537 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 06:34:43,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 65 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 06:34:43,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-12-17 06:34:43,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-12-17 06:34:43,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:34:43,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2021-12-17 06:34:43,561 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2021-12-17 06:34:43,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:34:43,561 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-12-17 06:34:43,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:34:43,562 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2021-12-17 06:34:43,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 06:34:43,562 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:34:43,562 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:34:43,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 06:34:43,563 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:34:43,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:34:43,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1736001843, now seen corresponding path program 1 times [2021-12-17 06:34:43,566 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 06:34:43,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111597362] [2021-12-17 06:34:43,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:34:43,567 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 06:34:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:34:43,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:34:43,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 06:34:43,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111597362] [2021-12-17 06:34:43,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111597362] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 06:34:43,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 06:34:43,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 06:34:43,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512215885] [2021-12-17 06:34:43,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 06:34:43,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 06:34:43,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 06:34:43,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 06:34:43,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 06:34:43,626 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:34:43,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:34:43,641 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-12-17 06:34:43,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 06:34:43,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-17 06:34:43,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:34:43,642 INFO L225 Difference]: With dead ends: 33 [2021-12-17 06:34:43,643 INFO L226 Difference]: Without dead ends: 25 [2021-12-17 06:34:43,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 06:34:43,647 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 06:34:43,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 27 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 06:34:43,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-17 06:34:43,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2021-12-17 06:34:43,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:34:43,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2021-12-17 06:34:43,655 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2021-12-17 06:34:43,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:34:43,656 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2021-12-17 06:34:43,657 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:34:43,659 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2021-12-17 06:34:43,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-17 06:34:43,659 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:34:43,660 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:34:43,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 06:34:43,660 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:34:43,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:34:43,661 INFO L85 PathProgramCache]: Analyzing trace with hash -842300589, now seen corresponding path program 1 times [2021-12-17 06:34:43,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 06:34:43,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794232565] [2021-12-17 06:34:43,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:34:43,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 06:34:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 06:34:43,682 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 06:34:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 06:34:43,708 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 06:34:43,709 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 06:34:43,709 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 06:34:43,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-17 06:34:43,726 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-12-17 06:34:43,729 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 06:34:43,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 06:34:43 BoogieIcfgContainer [2021-12-17 06:34:43,758 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 06:34:43,758 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 06:34:43,758 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 06:34:43,758 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 06:34:43,758 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:34:43" (3/4) ... [2021-12-17 06:34:43,760 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-17 06:34:43,760 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 06:34:43,761 INFO L158 Benchmark]: Toolchain (without parser) took 1203.43ms. Allocated memory is still 102.8MB. Free memory was 72.2MB in the beginning and 79.7MB in the end (delta: -7.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 06:34:43,761 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 77.6MB. Free memory was 34.9MB in the beginning and 34.8MB in the end (delta: 41.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 06:34:43,761 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.11ms. Allocated memory is still 102.8MB. Free memory was 71.7MB in the beginning and 78.7MB in the end (delta: -7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 06:34:43,761 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.65ms. Allocated memory is still 102.8MB. Free memory was 78.7MB in the beginning and 77.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 06:34:43,762 INFO L158 Benchmark]: Boogie Preprocessor took 34.68ms. Allocated memory is still 102.8MB. Free memory was 77.4MB in the beginning and 76.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 06:34:43,762 INFO L158 Benchmark]: RCFGBuilder took 267.86ms. Allocated memory is still 102.8MB. Free memory was 76.0MB in the beginning and 64.9MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 06:34:43,762 INFO L158 Benchmark]: TraceAbstraction took 660.96ms. Allocated memory is still 102.8MB. Free memory was 64.9MB in the beginning and 79.8MB in the end (delta: -15.0MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2021-12-17 06:34:43,762 INFO L158 Benchmark]: Witness Printer took 2.27ms. Allocated memory is still 102.8MB. Free memory was 79.8MB in the beginning and 79.7MB in the end (delta: 96.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 06:34:43,764 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 77.6MB. Free memory was 34.9MB in the beginning and 34.8MB in the end (delta: 41.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.11ms. Allocated memory is still 102.8MB. Free memory was 71.7MB in the beginning and 78.7MB in the end (delta: -7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.65ms. Allocated memory is still 102.8MB. Free memory was 78.7MB in the beginning and 77.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.68ms. Allocated memory is still 102.8MB. Free memory was 77.4MB in the beginning and 76.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 267.86ms. Allocated memory is still 102.8MB. Free memory was 76.0MB in the beginning and 64.9MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 660.96ms. Allocated memory is still 102.8MB. Free memory was 64.9MB in the beginning and 79.8MB in the end (delta: -15.0MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. * Witness Printer took 2.27ms. Allocated memory is still 102.8MB. Free memory was 79.8MB in the beginning and 79.7MB in the end (delta: 96.5kB). 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: 51]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of to_real at line 18, overapproximation of someBinaryArithmeticFLOAToperation at line 36. Possible FailurePath: [L1] int __return_main; [L12] int __return_125; VAL [__return_125=0, __return_main=0] [L15] int main__i; [L16] float main__z; [L17] float main__t; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L20] main__t = __VERIFIER_nondet_float() [L21] int main____CPAchecker_TMP_0; [L22] EXPR main__min[0] VAL [__return_125=0, __return_main=0, main__max={4:0}, main__min={5:0}, main__min[0]=49] [L22] COND TRUE main__t >= (main__min[0]) [L24] EXPR main__max[4UL] VAL [__return_125=0, __return_main=0, main__max={4:0}, main__max[4UL]=51, main__min={5:0}] [L24] COND TRUE main__t <= (main__max[4UL]) [L26] main____CPAchecker_TMP_0 = 1 VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__max={4:0}, main__min={5:0}] [L27] COND TRUE main____CPAchecker_TMP_0 != 0 [L29] main__i = 0 VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={4:0}, main__min={5:0}] [L31] COND TRUE main__i < 5UL [L33] EXPR main__max[main__i] VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={4:0}, main__max[main__i]=50, main__min={5:0}] [L33] COND TRUE main__t <= (main__max[main__i]) [L36] EXPR main__min[main__i] [L36] EXPR main__max[main__i] [L36] EXPR main__min[main__i] [L36] main__z = (main__t - (main__min[main__i])) / ((main__max[main__i]) - (main__min[main__i])) [L37] int main____CPAchecker_TMP_1; VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={4:0}, main__min={5:0}] [L38] COND FALSE !(main__z >= 0.0) VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={4:0}, main__min={5:0}] [L64] main____CPAchecker_TMP_1 = 0 VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={4:0}, main__min={5:0}] [L45] int __tmp_1; [L46] __tmp_1 = main____CPAchecker_TMP_1 [L47] int __VERIFIER_assert__cond; [L48] __VERIFIER_assert__cond = __tmp_1 VAL [__return_125=0, __return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={4:0}, main__min={5:0}] [L49] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_125=0, __return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={4:0}, main__min={5:0}] [L51] reach_error() VAL [__return_125=0, __return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={4:0}, main__min={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 37 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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 [2021-12-17 06:34:43,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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: /usr/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/float-benchs/interpolation.c.v+cfa-reducer.c -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.graphml --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 a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 06:34:45,406 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 06:34:45,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 06:34:45,442 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 06:34:45,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 06:34:45,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 06:34:45,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 06:34:45,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 06:34:45,452 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 06:34:45,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 06:34:45,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 06:34:45,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 06:34:45,463 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 06:34:45,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 06:34:45,466 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 06:34:45,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 06:34:45,471 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 06:34:45,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 06:34:45,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 06:34:45,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 06:34:45,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 06:34:45,479 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 06:34:45,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 06:34:45,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 06:34:45,486 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 06:34:45,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 06:34:45,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 06:34:45,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 06:34:45,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 06:34:45,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 06:34:45,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 06:34:45,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 06:34:45,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 06:34:45,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 06:34:45,492 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 06:34:45,492 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 06:34:45,493 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 06:34:45,493 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 06:34:45,493 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 06:34:45,494 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 06:34:45,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 06:34:45,496 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-17 06:34:45,523 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 06:34:45,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 06:34:45,524 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 06:34:45,525 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 06:34:45,525 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 06:34:45,525 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 06:34:45,526 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 06:34:45,526 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 06:34:45,527 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 06:34:45,527 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 06:34:45,527 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 06:34:45,527 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 06:34:45,528 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 06:34:45,528 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 06:34:45,528 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 06:34:45,528 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 06:34:45,528 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-17 06:34:45,528 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-17 06:34:45,528 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-17 06:34:45,529 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 06:34:45,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 06:34:45,529 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 06:34:45,529 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 06:34:45,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 06:34:45,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 06:34:45,529 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 06:34:45,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 06:34:45,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 06:34:45,530 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 06:34:45,530 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 06:34:45,530 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-17 06:34:45,530 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-17 06:34:45,531 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 06:34:45,531 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 06:34:45,531 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 06:34:45,531 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 06:34:45,531 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-17 06:34:45,531 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.graphml 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 -> a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 [2021-12-17 06:34:45,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 06:34:45,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 06:34:45,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 06:34:45,802 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 06:34:45,802 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 06:34:45,803 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2021-12-17 06:34:45,859 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1624657d/9b3bfc1a300d46a6ab8e3751431dde7a/FLAG1fcb59049 [2021-12-17 06:34:46,208 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 06:34:46,208 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2021-12-17 06:34:46,219 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1624657d/9b3bfc1a300d46a6ab8e3751431dde7a/FLAG1fcb59049 [2021-12-17 06:34:46,232 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1624657d/9b3bfc1a300d46a6ab8e3751431dde7a [2021-12-17 06:34:46,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 06:34:46,234 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 06:34:46,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 06:34:46,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 06:34:46,239 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 06:34:46,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 06:34:46" (1/1) ... [2021-12-17 06:34:46,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16664bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:46, skipping insertion in model container [2021-12-17 06:34:46,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 06:34:46" (1/1) ... [2021-12-17 06:34:46,246 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 06:34:46,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 06:34:46,400 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2021-12-17 06:34:46,410 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 06:34:46,442 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 06:34:46,472 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2021-12-17 06:34:46,483 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 06:34:46,495 INFO L208 MainTranslator]: Completed translation [2021-12-17 06:34:46,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:46 WrapperNode [2021-12-17 06:34:46,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 06:34:46,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 06:34:46,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 06:34:46,498 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 06:34:46,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:46" (1/1) ... [2021-12-17 06:34:46,509 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:46" (1/1) ... [2021-12-17 06:34:46,532 INFO L137 Inliner]: procedures = 19, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 109 [2021-12-17 06:34:46,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 06:34:46,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 06:34:46,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 06:34:46,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 06:34:46,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:46" (1/1) ... [2021-12-17 06:34:46,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:46" (1/1) ... [2021-12-17 06:34:46,552 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:46" (1/1) ... [2021-12-17 06:34:46,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:46" (1/1) ... [2021-12-17 06:34:46,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:46" (1/1) ... [2021-12-17 06:34:46,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:46" (1/1) ... [2021-12-17 06:34:46,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:46" (1/1) ... [2021-12-17 06:34:46,576 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 06:34:46,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 06:34:46,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 06:34:46,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 06:34:46,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:46" (1/1) ... [2021-12-17 06:34:46,585 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 06:34:46,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 06:34:46,602 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 06:34:46,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 06:34:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 06:34:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2021-12-17 06:34:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-17 06:34:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 06:34:46,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2021-12-17 06:34:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 06:34:46,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 06:34:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 06:34:46,680 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 06:34:46,681 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 06:34:49,094 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 06:34:49,097 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 06:34:49,098 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-17 06:34:49,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:34:49 BoogieIcfgContainer [2021-12-17 06:34:49,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 06:34:49,100 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 06:34:49,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 06:34:49,102 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 06:34:49,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 06:34:46" (1/3) ... [2021-12-17 06:34:49,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646280a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 06:34:49, skipping insertion in model container [2021-12-17 06:34:49,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:34:46" (2/3) ... [2021-12-17 06:34:49,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646280a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 06:34:49, skipping insertion in model container [2021-12-17 06:34:49,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:34:49" (3/3) ... [2021-12-17 06:34:49,104 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+cfa-reducer.c [2021-12-17 06:34:49,112 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 06:34:49,113 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 06:34:49,144 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 06:34:49,149 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 06:34:49,149 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 06:34:49,157 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:34:49,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-17 06:34:49,160 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:34:49,160 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:34:49,161 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:34:49,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:34:49,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1718991182, now seen corresponding path program 1 times [2021-12-17 06:34:49,171 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:34:49,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1795151665] [2021-12-17 06:34:49,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:34:49,173 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:34:49,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:34:49,174 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 06:34:49,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-17 06:34:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:34:49,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 06:34:49,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:34:49,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:34:49,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 06:34:49,484 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:34:49,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1795151665] [2021-12-17 06:34:49,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1795151665] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 06:34:49,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 06:34:49,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 06:34:49,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410971417] [2021-12-17 06:34:49,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 06:34:49,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 06:34:49,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:34:49,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 06:34:49,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 06:34:49,513 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:34:51,633 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 06:34:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:34:51,682 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2021-12-17 06:34:51,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 06:34:51,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-17 06:34:51,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:34:51,690 INFO L225 Difference]: With dead ends: 32 [2021-12-17 06:34:51,690 INFO L226 Difference]: Without dead ends: 18 [2021-12-17 06:34:51,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 06:34:51,695 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-17 06:34:51,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 39 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2021-12-17 06:34:51,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-12-17 06:34:51,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2021-12-17 06:34:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:34:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2021-12-17 06:34:51,726 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 12 [2021-12-17 06:34:51,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:34:51,726 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-12-17 06:34:51,726 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:34:51,727 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2021-12-17 06:34:51,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-17 06:34:51,728 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:34:51,728 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:34:51,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-17 06:34:51,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 06:34:51,929 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:34:51,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:34:51,930 INFO L85 PathProgramCache]: Analyzing trace with hash -859311250, now seen corresponding path program 1 times [2021-12-17 06:34:51,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:34:51,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283715181] [2021-12-17 06:34:51,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:34:51,931 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:34:51,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:34:51,932 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 06:34:51,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-17 06:34:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:34:52,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-17 06:34:52,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:34:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:34:52,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 06:34:52,227 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:34:52,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283715181] [2021-12-17 06:34:52,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283715181] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 06:34:52,227 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 06:34:52,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-17 06:34:52,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424052652] [2021-12-17 06:34:52,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 06:34:52,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 06:34:52,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:34:52,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 06:34:52,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 06:34:52,229 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:34:53,451 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 06:34:53,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:34:53,522 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2021-12-17 06:34:53,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 06:34:53,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-17 06:34:53,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:34:53,523 INFO L225 Difference]: With dead ends: 20 [2021-12-17 06:34:53,523 INFO L226 Difference]: Without dead ends: 16 [2021-12-17 06:34:53,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-17 06:34:53,524 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2021-12-17 06:34:53,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2021-12-17 06:34:53,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-12-17 06:34:53,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-12-17 06:34:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:34:53,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2021-12-17 06:34:53,527 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2021-12-17 06:34:53,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:34:53,528 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2021-12-17 06:34:53,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:34:53,528 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2021-12-17 06:34:53,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-17 06:34:53,528 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:34:53,528 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:34:53,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-17 06:34:53,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 06:34:53,736 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:34:53,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:34:53,736 INFO L85 PathProgramCache]: Analyzing trace with hash -842300589, now seen corresponding path program 1 times [2021-12-17 06:34:53,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:34:53,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1038951623] [2021-12-17 06:34:53,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:34:53,737 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:34:53,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:34:53,738 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 06:34:53,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-17 06:34:53,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:34:54,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-17 06:34:54,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:34:56,284 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 06:34:56,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 86 [2021-12-17 06:35:42,957 WARN L227 SmtUtils]: Spent 12.37s on a formula simplification. DAG size of input: 39 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 06:36:39,282 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53)))))) is different from false [2021-12-17 06:36:41,310 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53)))))) is different from true [2021-12-17 06:39:15,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:39:15,057 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 06:39:15,057 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:39:15,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1038951623] [2021-12-17 06:39:15,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1038951623] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 06:39:15,057 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 06:39:15,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-17 06:39:15,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089259941] [2021-12-17 06:39:15,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 06:39:15,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-17 06:39:15,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:39:15,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-17 06:39:15,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=58, Unknown=5, NotChecked=16, Total=110 [2021-12-17 06:39:15,063 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:39:17,263 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 06:39:50,573 WARN L227 SmtUtils]: Spent 26.17s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 06:39:52,709 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 06:39:54,720 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 06:39:54,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:39:54,863 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2021-12-17 06:39:54,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-17 06:39:54,871 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-17 06:39:54,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:39:54,871 INFO L225 Difference]: With dead ends: 24 [2021-12-17 06:39:54,871 INFO L226 Difference]: Without dead ends: 19 [2021-12-17 06:39:54,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 68.0s TimeCoverageRelationStatistics Valid=38, Invalid=69, Unknown=7, NotChecked=18, Total=132 [2021-12-17 06:39:54,872 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 11 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2021-12-17 06:39:54,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 14 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 2 Unknown, 31 Unchecked, 6.6s Time] [2021-12-17 06:39:54,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-12-17 06:39:54,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-12-17 06:39:54,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:39:54,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2021-12-17 06:39:54,876 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2021-12-17 06:39:54,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:39:54,876 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2021-12-17 06:39:54,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:39:54,876 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2021-12-17 06:39:54,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-17 06:39:54,877 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:39:54,877 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:39:54,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-17 06:39:55,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 06:39:55,081 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:39:55,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:39:55,082 INFO L85 PathProgramCache]: Analyzing trace with hash -858361424, now seen corresponding path program 1 times [2021-12-17 06:39:55,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:39:55,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659028816] [2021-12-17 06:39:55,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:39:55,083 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:39:55,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:39:55,084 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 06:39:55,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-17 06:39:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:39:55,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-17 06:39:55,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:39:57,993 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-17 06:39:57,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 86 [2021-12-17 06:40:53,148 WARN L227 SmtUtils]: Spent 14.07s on a formula simplification. DAG size of input: 39 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 06:41:27,541 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (fp.geq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__z~0#1|) (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0))))))) is different from false [2021-12-17 06:42:50,656 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))))) (and (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.geq .cse2 (_ +zero 11 53)) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.leq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))))))) is different from false [2021-12-17 06:42:52,689 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse0 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))))) (and (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (= .cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.geq .cse2 (_ +zero 11 53)) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.leq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))))))) is different from true [2021-12-17 06:45:30,180 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse0 .cse2))))) (and (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.geq .cse1 (_ +zero 11 53)) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))))))) is different from false [2021-12-17 06:45:32,231 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse0 .cse2))))) (and (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32))) (fp.geq .cse1 (_ +zero 11 53)) (= .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))))))) is different from true [2021-12-17 06:46:47,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:46:47,558 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 06:46:47,558 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:46:47,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659028816] [2021-12-17 06:46:47,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659028816] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 06:46:47,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 06:46:47,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-17 06:46:47,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222314328] [2021-12-17 06:46:47,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 06:46:47,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-17 06:46:47,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:46:47,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-17 06:46:47,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=59, Unknown=8, NotChecked=54, Total=156 [2021-12-17 06:46:47,560 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:46:49,495 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 06:46:51,734 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))) (.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|))) (and (= c_currentRoundingMode roundNearestTiesToEven) (= .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= (_ bv0 32) |c_ULTIMATE.start_main_~#main__max~0#1.offset|) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse2) (= .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= .cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse2 .cse1)))))) (= (_ bv0 32) |c_ULTIMATE.start_main_~#main__min~0#1.offset|) (= (let ((.cse3 (select .cse4 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32))) (= (let ((.cse5 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32))) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse6 (select .cse4 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv0 32)))) is different from false [2021-12-17 06:46:53,122 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 06:46:53,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:46:53,449 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2021-12-17 06:46:53,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 06:46:53,456 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-17 06:46:53,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:46:53,456 INFO L225 Difference]: With dead ends: 25 [2021-12-17 06:46:53,456 INFO L226 Difference]: Without dead ends: 17 [2021-12-17 06:46:53,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 49.2s TimeCoverageRelationStatistics Valid=37, Invalid=60, Unknown=9, NotChecked=76, Total=182 [2021-12-17 06:46:53,457 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 30 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2021-12-17 06:46:53,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 29 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 82 Unchecked, 3.8s Time] [2021-12-17 06:46:53,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-12-17 06:46:53,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-12-17 06:46:53,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:46:53,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2021-12-17 06:46:53,461 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2021-12-17 06:46:53,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:46:53,461 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-12-17 06:46:53,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:46:53,461 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2021-12-17 06:46:53,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-17 06:46:53,461 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:46:53,462 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:46:53,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-17 06:46:53,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 06:46:53,667 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:46:53,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:46:53,668 INFO L85 PathProgramCache]: Analyzing trace with hash 392786167, now seen corresponding path program 1 times [2021-12-17 06:46:53,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:46:53,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608496544] [2021-12-17 06:46:53,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:46:53,668 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:46:53,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:46:53,669 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 06:46:53,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-17 06:46:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:46:53,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 06:46:53,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:46:53,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:46:53,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 06:46:54,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:46:54,148 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:46:54,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608496544] [2021-12-17 06:46:54,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608496544] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 06:46:54,148 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 06:46:54,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-17 06:46:54,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128062096] [2021-12-17 06:46:54,149 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 06:46:54,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 06:46:54,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:46:54,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 06:46:54,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-17 06:46:54,150 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:46:56,404 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 06:46:56,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:46:56,513 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2021-12-17 06:46:56,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 06:46:56,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-12-17 06:46:56,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:46:56,514 INFO L225 Difference]: With dead ends: 33 [2021-12-17 06:46:56,514 INFO L226 Difference]: Without dead ends: 25 [2021-12-17 06:46:56,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-12-17 06:46:56,515 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2021-12-17 06:46:56,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 47 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2021-12-17 06:46:56,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-17 06:46:56,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2021-12-17 06:46:56,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:46:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2021-12-17 06:46:56,519 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 14 [2021-12-17 06:46:56,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:46:56,519 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2021-12-17 06:46:56,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:46:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2021-12-17 06:46:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-17 06:46:56,520 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:46:56,520 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 06:46:56,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-17 06:46:56,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 06:46:56,727 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:46:56,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:46:56,728 INFO L85 PathProgramCache]: Analyzing trace with hash 467686415, now seen corresponding path program 1 times [2021-12-17 06:46:56,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:46:56,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368268964] [2021-12-17 06:46:56,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:46:56,728 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:46:56,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:46:56,729 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 06:46:56,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-17 06:46:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:46:56,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-17 06:46:56,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:47:00,667 INFO L354 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2021-12-17 06:47:00,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 225 treesize of output 109 [2021-12-17 06:47:52,194 WARN L227 SmtUtils]: Spent 13.63s on a formula simplification. DAG size of input: 55 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 06:48:30,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:48:30,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 06:48:40,022 WARN L838 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) is different from false [2021-12-17 06:48:42,081 WARN L860 $PredicateComparison]: unable to prove that (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) is different from true [2021-12-17 06:48:52,459 WARN L838 $PredicateComparison]: unable to prove that (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|))) is different from false [2021-12-17 06:48:54,520 WARN L860 $PredicateComparison]: unable to prove that (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse2)))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) .cse0))))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|))) is different from true [2021-12-17 06:49:03,783 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1))))) is different from false [2021-12-17 06:49:05,858 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse3)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1))))) is different from true [2021-12-17 06:49:20,469 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse3 (_ bv4 32))))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse3 (_ bv4 32))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|)))) is different from false [2021-12-17 06:49:22,539 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (bvmul |c_ULTIMATE.start_main_~main__i~0#1| (_ bv4 32)))) (let ((.cse1 (let ((.cse4 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| .cse3 (_ bv4 32))))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (or (fp.geq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) (bvadd |c_ULTIMATE.start_main_~#main__min~0#1.offset| .cse3 (_ bv4 32))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub c_currentRoundingMode .cse1 .cse0)))) (_ +zero 11 53)) (not (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| .cse1)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| |c_ULTIMATE.start_main_#t~mem7#1|)))) is different from true Killed by 15