./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/loop-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/loop-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa --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 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 17:50:48,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 17:50:48,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 17:50:48,902 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 17:50:48,902 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 17:50:48,903 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 17:50:48,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 17:50:48,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 17:50:48,908 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 17:50:48,909 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 17:50:48,910 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 17:50:48,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 17:50:48,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 17:50:48,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 17:50:48,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 17:50:48,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 17:50:48,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 17:50:48,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 17:50:48,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 17:50:48,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 17:50:48,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 17:50:48,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 17:50:48,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 17:50:48,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 17:50:48,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 17:50:48,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 17:50:48,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 17:50:48,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 17:50:48,929 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 17:50:48,929 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 17:50:48,930 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 17:50:48,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 17:50:48,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 17:50:48,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 17:50:48,933 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 17:50:48,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 17:50:48,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 17:50:48,933 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 17:50:48,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 17:50:48,934 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 17:50:48,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 17:50:48,935 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 17:50:48,953 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 17:50:48,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 17:50:48,953 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 17:50:48,954 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 17:50:48,954 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 17:50:48,954 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 17:50:48,955 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 17:50:48,955 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 17:50:48,955 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 17:50:48,955 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 17:50:48,955 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 17:50:48,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 17:50:48,956 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 17:50:48,956 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 17:50:48,956 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 17:50:48,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 17:50:48,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 17:50:48,956 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 17:50:48,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 17:50:48,957 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 17:50:48,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 17:50:48,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 17:50:48,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 17:50:48,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 17:50:48,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:50:48,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 17:50:48,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 17:50:48,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 17:50:48,958 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 17:50:48,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 17:50:48,958 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 17:50:48,958 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 17:50:48,959 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 17:50:48,959 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 17:50:48,959 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa 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 -> 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b [2021-12-06 17:50:49,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 17:50:49,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 17:50:49,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 17:50:49,169 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 17:50:49,170 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 17:50:49,171 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/float-benchs/loop-1.c [2021-12-06 17:50:49,211 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/data/713185cb2/8c48931048df4a7495f406eac73d1ab1/FLAG4b5da5924 [2021-12-06 17:50:49,609 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 17:50:49,609 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/sv-benchmarks/c/float-benchs/loop-1.c [2021-12-06 17:50:49,613 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/data/713185cb2/8c48931048df4a7495f406eac73d1ab1/FLAG4b5da5924 [2021-12-06 17:50:49,623 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/data/713185cb2/8c48931048df4a7495f406eac73d1ab1 [2021-12-06 17:50:49,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 17:50:49,626 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 17:50:49,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 17:50:49,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 17:50:49,630 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 17:50:49,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:50:49" (1/1) ... [2021-12-06 17:50:49,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@761af6cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:49, skipping insertion in model container [2021-12-06 17:50:49,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:50:49" (1/1) ... [2021-12-06 17:50:49,637 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 17:50:49,646 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 17:50:49,763 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2021-12-06 17:50:49,772 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:50:49,779 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 17:50:49,787 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2021-12-06 17:50:49,789 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:50:49,798 INFO L208 MainTranslator]: Completed translation [2021-12-06 17:50:49,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:49 WrapperNode [2021-12-06 17:50:49,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 17:50:49,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 17:50:49,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 17:50:49,799 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 17:50:49,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:49" (1/1) ... [2021-12-06 17:50:49,809 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:49" (1/1) ... [2021-12-06 17:50:49,820 INFO L137 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2021-12-06 17:50:49,820 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 17:50:49,821 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 17:50:49,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 17:50:49,821 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 17:50:49,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:49" (1/1) ... [2021-12-06 17:50:49,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:49" (1/1) ... [2021-12-06 17:50:49,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:49" (1/1) ... [2021-12-06 17:50:49,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:49" (1/1) ... [2021-12-06 17:50:49,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:49" (1/1) ... [2021-12-06 17:50:49,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:49" (1/1) ... [2021-12-06 17:50:49,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:49" (1/1) ... [2021-12-06 17:50:49,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 17:50:49,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 17:50:49,835 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 17:50:49,835 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 17:50:49,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:49" (1/1) ... [2021-12-06 17:50:49,843 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:50:49,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:50:49,863 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 17:50:49,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 17:50:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 17:50:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 17:50:49,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 17:50:49,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 17:50:49,946 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 17:50:49,947 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 17:50:50,006 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 17:50:50,010 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 17:50:50,010 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-06 17:50:50,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:50:50 BoogieIcfgContainer [2021-12-06 17:50:50,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 17:50:50,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 17:50:50,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 17:50:50,016 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 17:50:50,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:50:49" (1/3) ... [2021-12-06 17:50:50,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea9d0be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:50:50, skipping insertion in model container [2021-12-06 17:50:50,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:49" (2/3) ... [2021-12-06 17:50:50,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea9d0be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:50:50, skipping insertion in model container [2021-12-06 17:50:50,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:50:50" (3/3) ... [2021-12-06 17:50:50,019 INFO L111 eAbstractionObserver]: Analyzing ICFG loop-1.c [2021-12-06 17:50:50,024 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 17:50:50,024 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 17:50:50,065 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 17:50:50,071 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-06 17:50:50,071 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 17:50:50,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) 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-06 17:50:50,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-06 17:50:50,086 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:50:50,086 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-06 17:50:50,087 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:50:50,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:50:50,091 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2021-12-06 17:50:50,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:50:50,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120197665] [2021-12-06 17:50:50,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:50:50,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:50:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:50:50,170 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:50:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:50:50,193 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:50:50,195 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 17:50:50,195 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-06 17:50:50,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 17:50:50,201 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2021-12-06 17:50:50,203 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 17:50:50,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:50:50 BoogieIcfgContainer [2021-12-06 17:50:50,218 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 17:50:50,218 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 17:50:50,218 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 17:50:50,219 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 17:50:50,219 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:50:50" (3/4) ... [2021-12-06 17:50:50,222 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-06 17:50:50,222 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 17:50:50,223 INFO L158 Benchmark]: Toolchain (without parser) took 596.12ms. Allocated memory is still 90.2MB. Free memory was 54.5MB in the beginning and 42.7MB in the end (delta: 11.8MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2021-12-06 17:50:50,223 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 90.2MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:50:50,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.69ms. Allocated memory is still 90.2MB. Free memory was 54.3MB in the beginning and 67.1MB in the end (delta: -12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-06 17:50:50,224 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.69ms. Allocated memory is still 90.2MB. Free memory was 67.1MB in the beginning and 65.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:50:50,224 INFO L158 Benchmark]: Boogie Preprocessor took 13.20ms. Allocated memory is still 90.2MB. Free memory was 65.7MB in the beginning and 64.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:50:50,225 INFO L158 Benchmark]: RCFGBuilder took 177.04ms. Allocated memory is still 90.2MB. Free memory was 64.7MB in the beginning and 56.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-06 17:50:50,225 INFO L158 Benchmark]: TraceAbstraction took 204.79ms. Allocated memory is still 90.2MB. Free memory was 55.9MB in the beginning and 43.0MB in the end (delta: 12.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-06 17:50:50,226 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 90.2MB. Free memory was 43.0MB in the beginning and 42.7MB in the end (delta: 344.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:50:50,229 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.13ms. Allocated memory is still 90.2MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 170.69ms. Allocated memory is still 90.2MB. Free memory was 54.3MB in the beginning and 67.1MB in the end (delta: -12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.69ms. Allocated memory is still 90.2MB. Free memory was 67.1MB in the beginning and 65.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 13.20ms. Allocated memory is still 90.2MB. Free memory was 65.7MB in the beginning and 64.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 177.04ms. Allocated memory is still 90.2MB. Free memory was 64.7MB in the beginning and 56.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 204.79ms. Allocated memory is still 90.2MB. Free memory was 55.9MB in the beginning and 43.0MB in the end (delta: 12.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 90.2MB. Free memory was 43.0MB in the beginning and 42.7MB in the end (delta: 344.6kB). 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: 4]: 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 20, overapproximation of someBinaryDOUBLEComparisonOperation at line 20. Possible FailurePath: [L8] float x, y, z; [L10] x = 1.f [L11] y = 1e7 [L12] z = 42.f VAL [x=1, y=10000000, z=42] [L14] COND FALSE !(x < y) VAL [x=1, y=10000000, z=42] [L20] CALL __VERIFIER_assert(z >= 0.f && z <= 1e8) [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L4] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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-06 17:50:50,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/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=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/loop-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa --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 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 17:50:51,785 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 17:50:51,787 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 17:50:51,810 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 17:50:51,810 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 17:50:51,811 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 17:50:51,812 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 17:50:51,814 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 17:50:51,816 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 17:50:51,816 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 17:50:51,817 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 17:50:51,818 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 17:50:51,818 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 17:50:51,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 17:50:51,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 17:50:51,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 17:50:51,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 17:50:51,823 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 17:50:51,828 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 17:50:51,830 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 17:50:51,832 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 17:50:51,833 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 17:50:51,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 17:50:51,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 17:50:51,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 17:50:51,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 17:50:51,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 17:50:51,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 17:50:51,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 17:50:51,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 17:50:51,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 17:50:51,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 17:50:51,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 17:50:51,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 17:50:51,846 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 17:50:51,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 17:50:51,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 17:50:51,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 17:50:51,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 17:50:51,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 17:50:51,849 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 17:50:51,850 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-06 17:50:51,870 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 17:50:51,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 17:50:51,871 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 17:50:51,871 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 17:50:51,871 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 17:50:51,871 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 17:50:51,872 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 17:50:51,872 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 17:50:51,872 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 17:50:51,873 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 17:50:51,873 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 17:50:51,873 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 17:50:51,873 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 17:50:51,873 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 17:50:51,873 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 17:50:51,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 17:50:51,873 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-06 17:50:51,874 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-06 17:50:51,874 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-06 17:50:51,874 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 17:50:51,874 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 17:50:51,874 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 17:50:51,874 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 17:50:51,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 17:50:51,875 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 17:50:51,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 17:50:51,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:50:51,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 17:50:51,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 17:50:51,875 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 17:50:51,875 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-06 17:50:51,876 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-06 17:50:51,876 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 17:50:51,876 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 17:50:51,876 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 17:50:51,876 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 17:50:51,876 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-06 17:50:51,876 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa 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 -> 1b0545f8921a3072195050599e45eb6fe3a423f5bd887720e0418c3666aaad9b [2021-12-06 17:50:52,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 17:50:52,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 17:50:52,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 17:50:52,125 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 17:50:52,125 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 17:50:52,126 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/float-benchs/loop-1.c [2021-12-06 17:50:52,169 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/data/8584842f1/d0c4214f0c39420f96dec51188210c21/FLAG7da7e12f5 [2021-12-06 17:50:52,552 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 17:50:52,552 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/sv-benchmarks/c/float-benchs/loop-1.c [2021-12-06 17:50:52,558 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/data/8584842f1/d0c4214f0c39420f96dec51188210c21/FLAG7da7e12f5 [2021-12-06 17:50:52,571 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/data/8584842f1/d0c4214f0c39420f96dec51188210c21 [2021-12-06 17:50:52,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 17:50:52,575 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 17:50:52,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 17:50:52,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 17:50:52,580 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 17:50:52,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:50:52" (1/1) ... [2021-12-06 17:50:52,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ebc1d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:52, skipping insertion in model container [2021-12-06 17:50:52,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:50:52" (1/1) ... [2021-12-06 17:50:52,589 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 17:50:52,600 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 17:50:52,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2021-12-06 17:50:52,715 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:50:52,724 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 17:50:52,733 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/sv-benchmarks/c/float-benchs/loop-1.c[311,324] [2021-12-06 17:50:52,735 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:50:52,753 INFO L208 MainTranslator]: Completed translation [2021-12-06 17:50:52,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:52 WrapperNode [2021-12-06 17:50:52,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 17:50:52,754 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 17:50:52,755 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 17:50:52,755 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 17:50:52,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:52" (1/1) ... [2021-12-06 17:50:52,771 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:52" (1/1) ... [2021-12-06 17:50:52,784 INFO L137 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2021-12-06 17:50:52,784 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 17:50:52,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 17:50:52,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 17:50:52,785 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 17:50:52,791 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:52" (1/1) ... [2021-12-06 17:50:52,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:52" (1/1) ... [2021-12-06 17:50:52,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:52" (1/1) ... [2021-12-06 17:50:52,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:52" (1/1) ... [2021-12-06 17:50:52,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:52" (1/1) ... [2021-12-06 17:50:52,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:52" (1/1) ... [2021-12-06 17:50:52,806 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:52" (1/1) ... [2021-12-06 17:50:52,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 17:50:52,810 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 17:50:52,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 17:50:52,810 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 17:50:52,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:52" (1/1) ... [2021-12-06 17:50:52,818 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:50:52,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:50:52,835 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 17:50:52,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 17:50:52,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 17:50:52,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 17:50:52,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 17:50:52,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-06 17:50:52,920 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 17:50:52,922 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 17:50:53,398 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 17:50:53,402 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 17:50:53,403 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-06 17:50:53,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:50:53 BoogieIcfgContainer [2021-12-06 17:50:53,404 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 17:50:53,406 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 17:50:53,406 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 17:50:53,408 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 17:50:53,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:50:52" (1/3) ... [2021-12-06 17:50:53,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7693405d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:50:53, skipping insertion in model container [2021-12-06 17:50:53,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:50:52" (2/3) ... [2021-12-06 17:50:53,409 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7693405d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:50:53, skipping insertion in model container [2021-12-06 17:50:53,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:50:53" (3/3) ... [2021-12-06 17:50:53,410 INFO L111 eAbstractionObserver]: Analyzing ICFG loop-1.c [2021-12-06 17:50:53,414 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 17:50:53,415 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 17:50:53,449 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 17:50:53,454 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-06 17:50:53,454 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 17:50:53,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) 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-06 17:50:53,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-06 17:50:53,467 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:50:53,468 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-06 17:50:53,468 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:50:53,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:50:53,472 INFO L85 PathProgramCache]: Analyzing trace with hash 889633835, now seen corresponding path program 1 times [2021-12-06 17:50:53,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:50:53,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994753457] [2021-12-06 17:50:53,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:50:53,481 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:50:53,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:50:53,482 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:50:53,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-06 17:50:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:50:53,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-06 17:50:53,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:50:53,613 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-06 17:50:53,614 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:50:53,614 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:50:53,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994753457] [2021-12-06 17:50:53,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994753457] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:50:53,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:50:53,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-06 17:50:53,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841183256] [2021-12-06 17:50:53,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:50:53,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-06 17:50:53,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:50:53,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-06 17:50:53,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-06 17:50:53,643 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-06 17:50:53,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:50:53,654 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2021-12-06 17:50:53,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-06 17:50:53,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2021-12-06 17:50:53,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:50:53,661 INFO L225 Difference]: With dead ends: 20 [2021-12-06 17:50:53,661 INFO L226 Difference]: Without dead ends: 8 [2021-12-06 17:50:53,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-06 17:50:53,666 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:50:53,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 2 Unchecked, 0.0s Time] [2021-12-06 17:50:53,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-12-06 17:50:53,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-12-06 17:50:53,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-06 17:50:53,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2021-12-06 17:50:53,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2021-12-06 17:50:53,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:50:53,690 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2021-12-06 17:50:53,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-06 17:50:53,690 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-12-06 17:50:53,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-06 17:50:53,691 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:50:53,691 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:50:53,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-06 17:50:53,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:50:53,892 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:50:53,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:50:53,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1810510480, now seen corresponding path program 1 times [2021-12-06 17:50:53,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:50:53,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661111056] [2021-12-06 17:50:53,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:50:53,893 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:50:53,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:50:53,894 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:50:53,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-06 17:50:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:50:53,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 17:50:53,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:50:54,062 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-06 17:50:54,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:50:57,409 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-06 17:50:57,409 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:50:57,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661111056] [2021-12-06 17:50:57,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661111056] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:50:57,410 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:50:57,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-12-06 17:50:57,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526261676] [2021-12-06 17:50:57,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:50:57,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-06 17:50:57,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:50:57,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-06 17:50:57,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=25, Unknown=1, NotChecked=0, Total=42 [2021-12-06 17:50:57,412 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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-06 17:51:03,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:51:03,156 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2021-12-06 17:51:03,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:51:03,161 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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 7 [2021-12-06 17:51:03,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:51:03,161 INFO L225 Difference]: With dead ends: 15 [2021-12-06 17:51:03,161 INFO L226 Difference]: Without dead ends: 11 [2021-12-06 17:51:03,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=36, Invalid=53, Unknown=1, NotChecked=0, Total=90 [2021-12-06 17:51:03,163 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:51:03,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 11 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-12-06 17:51:03,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2021-12-06 17:51:03,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2021-12-06 17:51:03,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-06 17:51:03,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2021-12-06 17:51:03,166 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2021-12-06 17:51:03,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:51:03,166 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2021-12-06 17:51:03,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 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-06 17:51:03,166 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2021-12-06 17:51:03,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-06 17:51:03,167 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:51:03,167 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2021-12-06 17:51:03,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-06 17:51:03,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:51:03,369 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:51:03,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:51:03,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1922847381, now seen corresponding path program 2 times [2021-12-06 17:51:03,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:51:03,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152992817] [2021-12-06 17:51:03,373 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 17:51:03,374 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:51:03,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:51:03,376 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:51:03,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-06 17:51:03,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 17:51:03,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 17:51:03,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-06 17:51:03,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:51:04,535 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:51:04,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:51:50,596 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0))) is different from false [2021-12-06 17:51:52,618 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0))) is different from true [2021-12-06 17:51:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-06 17:51:52,626 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:51:52,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152992817] [2021-12-06 17:51:52,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [152992817] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:51:52,626 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:51:52,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2021-12-06 17:51:52,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552144198] [2021-12-06 17:51:52,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:51:52,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-06 17:51:52,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:51:52,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-06 17:51:52,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=79, Unknown=10, NotChecked=20, Total=156 [2021-12-06 17:51:52,628 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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-06 17:51:58,037 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) |c_ULTIMATE.start_main_~y~0#1|) (fp.lt (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0)) (= .cse0 |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-12-06 17:52:30,343 WARN L227 SmtUtils]: Spent 18.36s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 17:52:32,393 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:52:49,150 WARN L227 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 17:52:51,187 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:52:53,197 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:53:00,424 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:53:03,041 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:53:08,466 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:53:11,518 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:53:13,270 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:53:13,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:53:13,271 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2021-12-06 17:53:13,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 17:53:13,298 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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) Word has length 10 [2021-12-06 17:53:13,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:53:13,299 INFO L225 Difference]: With dead ends: 20 [2021-12-06 17:53:13,299 INFO L226 Difference]: Without dead ends: 16 [2021-12-06 17:53:13,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 98.2s TimeCoverageRelationStatistics Valid=105, Invalid=160, Unknown=15, NotChecked=62, Total=342 [2021-12-06 17:53:13,302 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 16 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 24.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:53:13,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 13 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 41 Invalid, 6 Unknown, 11 Unchecked, 24.0s Time] [2021-12-06 17:53:13,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-12-06 17:53:13,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-12-06 17:53:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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-06 17:53:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2021-12-06 17:53:13,308 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2021-12-06 17:53:13,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:53:13,309 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2021-12-06 17:53:13,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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-06 17:53:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2021-12-06 17:53:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-06 17:53:13,310 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:53:13,310 INFO L514 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1] [2021-12-06 17:53:13,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-06 17:53:13,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:53:13,511 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:53:13,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:53:13,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1299398672, now seen corresponding path program 3 times [2021-12-06 17:53:13,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:53:13,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568760547] [2021-12-06 17:53:13,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-06 17:53:13,514 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:53:13,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:53:13,516 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:53:13,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-06 17:53:14,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-06 17:53:14,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 17:53:14,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-06 17:53:14,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:53:39,557 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:53:39,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:54:05,172 WARN L227 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 17:54:23,760 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse4 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse2)) (.cse3 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse2))) (let ((.cse0 (fp.add c_currentRoundingMode .cse3 .cse2)) (.cse1 (fp.sub c_currentRoundingMode .cse4 .cse2))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse2) (fp.sub c_currentRoundingMode .cse1 .cse2)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (not (fp.lt .cse3 .cse4)))))) is different from true [2021-12-06 17:54:48,183 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4)) (.cse6 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4))) (let ((.cse1 (fp.sub c_currentRoundingMode .cse6 .cse4)) (.cse0 (fp.add c_currentRoundingMode .cse5 .cse4))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse4)) (.cse3 (fp.sub c_currentRoundingMode .cse1 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse4) (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.lt |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (not (fp.lt .cse5 .cse6))))))) is different from true [2021-12-06 17:55:10,786 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse8 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5)) (.cse7 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5))) (let ((.cse0 (fp.add c_currentRoundingMode .cse7 .cse5)) (.cse1 (fp.sub c_currentRoundingMode .cse8 .cse5))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse1 .cse5)) (.cse2 (fp.add c_currentRoundingMode .cse0 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse2 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse3 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6)) (not (fp.lt .cse7 .cse8)))))))) is different from false [2021-12-06 17:55:12,825 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse8 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5)) (.cse7 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5))) (let ((.cse0 (fp.add c_currentRoundingMode .cse7 .cse5)) (.cse1 (fp.sub c_currentRoundingMode .cse8 .cse5))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse1 .cse5)) (.cse2 (fp.add c_currentRoundingMode .cse0 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse2 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse3 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6)) (not (fp.lt .cse7 .cse8)))))))) is different from true [2021-12-06 17:55:35,513 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse3) .cse3)) (.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse3) .cse3))) (let ((.cse5 (fp.add c_currentRoundingMode .cse0 .cse3)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse3))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse6 .cse3)) (.cse7 (fp.add c_currentRoundingMode .cse5 .cse3))) (let ((.cse2 (fp.add c_currentRoundingMode .cse7 .cse3)) (.cse4 (fp.sub c_currentRoundingMode .cse8 .cse3))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8)) (not (fp.lt .cse2 .cse4)))))))) is different from false [2021-12-06 17:55:37,557 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse3) .cse3)) (.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse3) .cse3))) (let ((.cse5 (fp.add c_currentRoundingMode .cse0 .cse3)) (.cse6 (fp.sub c_currentRoundingMode .cse1 .cse3))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse6 .cse3)) (.cse7 (fp.add c_currentRoundingMode .cse5 .cse3))) (let ((.cse2 (fp.add c_currentRoundingMode .cse7 .cse3)) (.cse4 (fp.sub c_currentRoundingMode .cse8 .cse3))) (or (not (fp.lt .cse0 .cse1)) (fp.lt (fp.add c_currentRoundingMode .cse2 .cse3) (fp.sub c_currentRoundingMode .cse4 .cse3)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8)) (not (fp.lt .cse2 .cse4)))))))) is different from true [2021-12-06 17:56:00,361 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse8) .cse8) .cse8)) (.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse8) .cse8) .cse8))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse8)) (.cse3 (fp.sub c_currentRoundingMode .cse1 .cse8))) (let ((.cse7 (fp.sub c_currentRoundingMode .cse3 .cse8)) (.cse6 (fp.add c_currentRoundingMode .cse2 .cse8))) (let ((.cse4 (fp.add c_currentRoundingMode .cse6 .cse8)) (.cse5 (fp.sub c_currentRoundingMode .cse7 .cse8))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse8) (fp.sub c_currentRoundingMode .cse5 .cse8)))))))) is different from false [2021-12-06 17:56:02,410 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse8) .cse8) .cse8)) (.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse8) .cse8) .cse8))) (let ((.cse2 (fp.add c_currentRoundingMode .cse0 .cse8)) (.cse3 (fp.sub c_currentRoundingMode .cse1 .cse8))) (let ((.cse7 (fp.sub c_currentRoundingMode .cse3 .cse8)) (.cse6 (fp.add c_currentRoundingMode .cse2 .cse8))) (let ((.cse4 (fp.add c_currentRoundingMode .cse6 .cse8)) (.cse5 (fp.sub c_currentRoundingMode .cse7 .cse8))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse8) (fp.sub c_currentRoundingMode .cse5 .cse8)))))))) is different from true [2021-12-06 17:56:25,311 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse8) .cse8) .cse8) .cse8)) (.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse8) .cse8) .cse8) .cse8))) (let ((.cse6 (fp.add c_currentRoundingMode .cse2 .cse8)) (.cse7 (fp.sub c_currentRoundingMode .cse3 .cse8))) (let ((.cse5 (fp.sub c_currentRoundingMode .cse7 .cse8)) (.cse4 (fp.add c_currentRoundingMode .cse6 .cse8))) (let ((.cse0 (fp.add c_currentRoundingMode .cse4 .cse8)) (.cse1 (fp.sub c_currentRoundingMode .cse5 .cse8))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse8) (fp.sub c_currentRoundingMode .cse1 .cse8)))))))) is different from false [2021-12-06 17:56:27,368 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse8) .cse8) .cse8) .cse8)) (.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse8) .cse8) .cse8) .cse8))) (let ((.cse6 (fp.add c_currentRoundingMode .cse2 .cse8)) (.cse7 (fp.sub c_currentRoundingMode .cse3 .cse8))) (let ((.cse5 (fp.sub c_currentRoundingMode .cse7 .cse8)) (.cse4 (fp.add c_currentRoundingMode .cse6 .cse8))) (let ((.cse0 (fp.add c_currentRoundingMode .cse4 .cse8)) (.cse1 (fp.sub c_currentRoundingMode .cse5 .cse8))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (not (fp.lt .cse4 .cse5)) (not (fp.lt .cse6 .cse7)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse8) (fp.sub c_currentRoundingMode .cse1 .cse8)))))))) is different from true [2021-12-06 17:56:50,378 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse8 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4) .cse4)) (.cse7 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4) .cse4) .cse4))) (let ((.cse5 (fp.add c_currentRoundingMode .cse7 .cse4)) (.cse6 (fp.sub c_currentRoundingMode .cse8 .cse4))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse6 .cse4)) (.cse2 (fp.add c_currentRoundingMode .cse5 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8)))))))) is different from false [2021-12-06 17:56:52,443 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse8 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4) .cse4)) (.cse7 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4) .cse4) .cse4))) (let ((.cse5 (fp.add c_currentRoundingMode .cse7 .cse4)) (.cse6 (fp.sub c_currentRoundingMode .cse8 .cse4))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse6 .cse4)) (.cse2 (fp.add c_currentRoundingMode .cse5 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8)))))))) is different from true [2021-12-06 17:56:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 42 not checked. [2021-12-06 17:56:52,467 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:56:52,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568760547] [2021-12-06 17:56:52,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568760547] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:56:52,467 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:56:52,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2021-12-06 17:56:52,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950875560] [2021-12-06 17:56:52,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:56:52,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-06 17:56:52,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:56:52,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-06 17:56:52,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=170, Unknown=16, NotChecked=238, Total=506 [2021-12-06 17:56:52,469 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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-06 17:56:53,724 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-06 17:56:55,852 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:56:57,943 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:57:00,147 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) |c_ULTIMATE.start_main_~y~0#1|) (let ((.cse8 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse4) .cse4) .cse4) .cse4) .cse4)) (.cse7 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse4) .cse4) .cse4) .cse4) .cse4))) (let ((.cse5 (fp.add c_currentRoundingMode .cse7 .cse4)) (.cse6 (fp.sub c_currentRoundingMode .cse8 .cse4))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse6 .cse4)) (.cse2 (fp.add c_currentRoundingMode .cse5 .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse4)) (.cse1 (fp.sub c_currentRoundingMode .cse3 .cse4))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse0 .cse4) (fp.sub c_currentRoundingMode .cse1 .cse4)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8))))))) (= .cse4 |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-12-06 17:57:02,208 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= (fp.add c_currentRoundingMode .cse0 .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (let ((.cse4 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0) .cse0)) (.cse3 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0) .cse0))) (let ((.cse7 (fp.add c_currentRoundingMode .cse3 .cse0)) (.cse8 (fp.sub c_currentRoundingMode .cse4 .cse0))) (let ((.cse6 (fp.sub c_currentRoundingMode .cse8 .cse0)) (.cse5 (fp.add c_currentRoundingMode .cse7 .cse0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse5 .cse0)) (.cse2 (fp.sub c_currentRoundingMode .cse6 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8)) (fp.lt (fp.add c_currentRoundingMode .cse1 .cse0) (fp.sub c_currentRoundingMode .cse2 .cse0))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-12-06 17:57:04,266 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0) .cse0)) (.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0) .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse2 .cse0))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse4 .cse0)) (.cse7 (fp.add c_currentRoundingMode .cse3 .cse0))) (let ((.cse5 (fp.add c_currentRoundingMode .cse7 .cse0)) (.cse6 (fp.sub c_currentRoundingMode .cse8 .cse0))) (or (not (fp.lt .cse1 .cse2)) (not (fp.lt .cse3 .cse4)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8)) (fp.lt (fp.add c_currentRoundingMode .cse5 .cse0) (fp.sub c_currentRoundingMode .cse6 .cse0))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-12-06 17:57:06,316 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~y~0#1|) (let ((.cse2 (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse0) .cse0)) (.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0) .cse0))) (let ((.cse5 (fp.add c_currentRoundingMode .cse1 .cse0)) (.cse6 (fp.sub c_currentRoundingMode .cse2 .cse0))) (let ((.cse8 (fp.sub c_currentRoundingMode .cse6 .cse0)) (.cse7 (fp.add c_currentRoundingMode .cse5 .cse0))) (let ((.cse3 (fp.add c_currentRoundingMode .cse7 .cse0)) (.cse4 (fp.sub c_currentRoundingMode .cse8 .cse0))) (or (not (fp.lt .cse1 .cse2)) (fp.lt (fp.add c_currentRoundingMode .cse3 .cse0) (fp.sub c_currentRoundingMode .cse4 .cse0)) (not (fp.lt .cse5 .cse6)) (not (fp.lt .cse7 .cse8)) (not (fp.lt .cse3 .cse4))))))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-12-06 17:57:08,361 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (and (let ((.cse8 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~y~0#1| .cse5)) (.cse7 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse5))) (let ((.cse0 (fp.add c_currentRoundingMode .cse7 .cse5)) (.cse1 (fp.sub c_currentRoundingMode .cse8 .cse5))) (let ((.cse3 (fp.sub c_currentRoundingMode .cse1 .cse5)) (.cse2 (fp.add c_currentRoundingMode .cse0 .cse5))) (let ((.cse4 (fp.add c_currentRoundingMode .cse2 .cse5)) (.cse6 (fp.sub c_currentRoundingMode .cse3 .cse5))) (or (not (fp.lt .cse0 .cse1)) (not (fp.lt .cse2 .cse3)) (fp.lt (fp.add c_currentRoundingMode .cse4 .cse5) (fp.sub c_currentRoundingMode .cse6 .cse5)) (not (fp.lt .cse4 .cse6)) (not (fp.lt .cse7 .cse8))))))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 .cse5) .cse5) .cse5) .cse5) |c_ULTIMATE.start_main_~x~0#1|) (= (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 10000000.0)) .cse5) .cse5) .cse5) .cse5) |c_ULTIMATE.start_main_~y~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-12-06 17:57:58,352 WARN L227 SmtUtils]: Spent 16.71s on a formula simplification. DAG size of input: 19 DAG size of output: 15 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 17:58:00,394 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:58:12,247 WARN L227 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 14 DAG size of output: 12 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 17:58:13,789 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:58:15,802 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:58:20,208 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:58:54,654 WARN L227 SmtUtils]: Spent 23.70s on a formula simplification. DAG size of input: 19 DAG size of output: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 17:58:56,680 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:58:58,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:58:58,050 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2021-12-06 17:58:58,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-06 17:58:58,076 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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 15 [2021-12-06 17:58:58,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:58:58,076 INFO L225 Difference]: With dead ends: 24 [2021-12-06 17:58:58,076 INFO L226 Difference]: Without dead ends: 20 [2021-12-06 17:58:58,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 177.5s TimeCoverageRelationStatistics Valid=163, Invalid=282, Unknown=23, NotChecked=588, Total=1056 [2021-12-06 17:58:58,078 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 15 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2021-12-06 17:58:58,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 27 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 79 Invalid, 6 Unknown, 88 Unchecked, 20.4s Time] [2021-12-06 17:58:58,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-06 17:58:58,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-12-06 17:58:58,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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-06 17:58:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2021-12-06 17:58:58,083 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 15 [2021-12-06 17:58:58,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:58:58,083 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2021-12-06 17:58:58,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 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-06 17:58:58,084 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2021-12-06 17:58:58,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-06 17:58:58,084 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:58:58,084 INFO L514 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1] [2021-12-06 17:58:58,104 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-06 17:58:58,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:58:58,286 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:58:58,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:58:58,288 INFO L85 PathProgramCache]: Analyzing trace with hash -764299568, now seen corresponding path program 4 times [2021-12-06 17:58:58,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:58:58,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232750934] [2021-12-06 17:58:58,289 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-06 17:58:58,290 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:58:58,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:58:58,292 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:58:58,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-06 17:59:00,802 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-06 17:59:00,802 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 17:59:00,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-06 17:59:00,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:59:52,968 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 17:59:52,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 18:01:00,765 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1)))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-12-06 18:01:09,669 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) is different from false [2021-12-06 18:01:19,241 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) is different from false [2021-12-06 18:01:21,267 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) is different from true [2021-12-06 18:01:30,273 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-12-06 18:01:32,304 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-12-06 18:01:42,546 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) is different from false [2021-12-06 18:01:53,952 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-12-06 18:01:55,987 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-12-06 18:02:04,960 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) is different from false [2021-12-06 18:02:06,997 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) is different from true [2021-12-06 18:02:16,947 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) is different from false [2021-12-06 18:02:18,989 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.geq .cse0 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)))) is different from true [2021-12-06 18:02:29,308 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-12-06 18:02:31,357 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-12-06 18:02:41,702 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from false [2021-12-06 18:02:43,754 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (fp.geq .cse0 (_ +zero 8 24)))) is different from true [2021-12-06 18:02:43,775 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 85 not checked. [2021-12-06 18:02:43,775 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 18:02:43,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232750934] [2021-12-06 18:02:43,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232750934] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 18:02:43,776 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 18:02:43,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2021-12-06 18:02:43,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412068239] [2021-12-06 18:02:43,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 18:02:43,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-06 18:02:43,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 18:02:43,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-06 18:02:43,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=385, Unknown=27, NotChecked=510, Total=1056 [2021-12-06 18:02:43,778 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 33 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 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-06 18:02:45,143 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-06 18:02:47,383 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 18:02:49,815 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 18:02:51,853 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 18:02:55,710 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 18:02:57,753 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 18:03:01,344 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 18:03:04,186 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1)))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (fp.geq .cse0 (_ +zero 8 24)) (= ((_ to_fp 8 24) c_currentRoundingMode 42.0) |c_ULTIMATE.start_main_~z~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-12-06 18:03:06,233 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 42.0) .cse1) |c_ULTIMATE.start_main_~z~0#1|) (fp.geq .cse0 (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2021-12-06 18:03:08,281 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (= (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 42.0) .cse1) |c_ULTIMATE.start_main_~z~0#1|) (fp.geq .cse0 (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-12-06 18:03:10,325 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (and (fp.geq .cse0 (_ +zero 8 24)) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 42.0) .cse1) .cse1) |c_ULTIMATE.start_main_~z~0#1|) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2021-12-06 18:03:12,368 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (and (fp.geq .cse0 (_ +zero 8 24)) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 42.0) .cse1) .cse1) |c_ULTIMATE.start_main_~z~0#1|) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-12-06 18:03:14,410 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (and (fp.geq .cse0 (_ +zero 8 24)) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 42.0) .cse1) .cse1) .cse1) |c_ULTIMATE.start_main_~z~0#1|) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2021-12-06 18:03:16,454 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (and (fp.geq .cse0 (_ +zero 8 24)) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 42.0) .cse1) .cse1) .cse1) |c_ULTIMATE.start_main_~z~0#1|) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-12-06 18:03:18,496 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) (and (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 42.0) .cse0) .cse0) .cse0) .cse0) |c_ULTIMATE.start_main_~z~0#1|) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse1) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (fp.geq .cse1 (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-12-06 18:03:22,027 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1) .cse1))) (and (fp.geq .cse0 (_ +zero 8 24)) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 42.0) .cse1) .cse1) .cse1) .cse1) .cse1) |c_ULTIMATE.start_main_~z~0#1|) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode 100000000.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2021-12-06 18:03:54,903 WARN L227 SmtUtils]: Spent 5.99s on a formula simplification. DAG size of input: 29 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 18:04:38,061 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1| .cse4))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 .cse4))) (let ((.cse3 (fp.add c_currentRoundingMode .cse0 .cse4)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 100000000.0))) (and (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1) (fp.geq .cse2 (_ +zero 8 24)) (fp.geq .cse0 (_ +zero 8 24)) (fp.geq |c_ULTIMATE.start_main_~z~0#1| (_ +zero 8 24)) (fp.geq .cse3 (_ +zero 8 24)) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse3) .cse1) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~z~0#1|) .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq ((_ to_fp 11 53) c_currentRoundingMode .cse2) .cse1)))))) is different from true [2021-12-06 18:05:02,366 WARN L227 SmtUtils]: Spent 12.68s on a formula simplification. DAG size of input: 19 DAG size of output: 13 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 18:05:06,113 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 18:05:12,428 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 18:05:15,165 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 18:05:17,179 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 18:05:33,210 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 18:05:50,979 WARN L227 SmtUtils]: Spent 12.63s on a formula simplification. DAG size of input: 22 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 18:05:52,726 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 18:05:54,293 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 18:05:56,309 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 18:05:58,325 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 18:06:00,119 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 18:06:02,133 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 18:06:14,983 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 18:06:15,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 18:06:15,158 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2021-12-06 18:06:15,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-06 18:06:15,159 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 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 19 [2021-12-06 18:06:15,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 18:06:15,161 INFO L225 Difference]: With dead ends: 35 [2021-12-06 18:06:15,161 INFO L226 Difference]: Without dead ends: 25 [2021-12-06 18:06:15,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 302.8s TimeCoverageRelationStatistics Valid=233, Invalid=660, Unknown=45, NotChecked=1224, Total=2162 [2021-12-06 18:06:15,163 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 16 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 20 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 51.0s IncrementalHoareTripleChecker+Time [2021-12-06 18:06:15,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 43 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 181 Invalid, 11 Unknown, 162 Unchecked, 51.0s Time] [2021-12-06 18:06:15,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-12-06 18:06:15,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-12-06 18:06:15,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 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-06 18:06:15,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2021-12-06 18:06:15,171 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 19 [2021-12-06 18:06:15,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 18:06:15,171 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2021-12-06 18:06:15,171 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 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-06 18:06:15,171 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2021-12-06 18:06:15,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-06 18:06:15,172 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 18:06:15,172 INFO L514 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1] [2021-12-06 18:06:15,197 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-06 18:06:15,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 18:06:15,374 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 18:06:15,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 18:06:15,376 INFO L85 PathProgramCache]: Analyzing trace with hash 152849867, now seen corresponding path program 5 times [2021-12-06 18:06:15,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 18:06:15,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192805419] [2021-12-06 18:06:15,378 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-06 18:06:15,378 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 18:06:15,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 18:06:15,379 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 18:06:15,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_25ffb5cc-980e-4084-87ad-999980f6dac9/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-06 18:06:17,268 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2021-12-06 18:06:17,269 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 18:06:17,349 WARN L261 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-06 18:06:17,351 INFO L286 TraceCheckSpWp]: Computing forward predicates...