./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound20.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 290432887833d1264fa39f327d8609faf39248fe680017022e16e5c72d0bf2b6 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 00:47:57,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 00:47:57,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 00:47:57,825 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 00:47:57,825 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 00:47:57,830 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 00:47:57,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 00:47:57,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 00:47:57,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 00:47:57,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 00:47:57,845 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 00:47:57,847 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 00:47:57,848 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 00:47:57,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 00:47:57,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 00:47:57,857 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 00:47:57,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 00:47:57,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 00:47:57,866 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 00:47:57,874 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 00:47:57,876 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 00:47:57,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 00:47:57,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 00:47:57,882 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 00:47:57,891 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 00:47:57,891 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 00:47:57,892 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 00:47:57,893 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 00:47:57,894 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 00:47:57,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 00:47:57,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 00:47:57,897 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 00:47:57,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 00:47:57,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 00:47:57,902 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 00:47:57,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 00:47:57,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 00:47:57,903 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 00:47:57,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 00:47:57,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 00:47:57,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 00:47:57,906 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-21 00:47:57,954 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 00:47:57,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 00:47:57,955 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 00:47:57,955 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 00:47:57,962 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 00:47:57,963 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 00:47:57,963 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 00:47:57,963 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 00:47:57,963 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 00:47:57,963 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 00:47:57,965 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 00:47:57,965 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 00:47:57,965 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 00:47:57,965 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 00:47:57,965 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 00:47:57,966 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 00:47:57,966 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 00:47:57,966 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 00:47:57,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 00:47:57,968 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 00:47:57,968 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 00:47:57,968 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 00:47:57,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 00:47:57,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 00:47:57,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 00:47:57,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 00:47:57,971 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 00:47:57,971 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 00:47:57,971 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 00:47:57,972 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 00:47:57,972 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 00:47:57,972 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 00:47:57,972 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:47:57,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 00:47:57,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 00:47:57,973 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 00:47:57,973 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 00:47:57,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 00:47:57,974 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 00:47:57,974 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 00:47:57,974 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 00:47:57,974 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/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_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P 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 -> Taipan 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 -> 290432887833d1264fa39f327d8609faf39248fe680017022e16e5c72d0bf2b6 [2021-11-21 00:47:58,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 00:47:58,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 00:47:58,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 00:47:58,269 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 00:47:58,270 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 00:47:58,272 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound20.c [2021-11-21 00:47:58,343 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/data/567cd1354/7fdafdd72d5c4adea10737d2821b942c/FLAG29dad5185 [2021-11-21 00:47:58,825 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 00:47:58,826 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound20.c [2021-11-21 00:47:58,832 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/data/567cd1354/7fdafdd72d5c4adea10737d2821b942c/FLAG29dad5185 [2021-11-21 00:47:59,198 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/data/567cd1354/7fdafdd72d5c4adea10737d2821b942c [2021-11-21 00:47:59,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 00:47:59,202 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 00:47:59,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 00:47:59,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 00:47:59,220 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 00:47:59,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:47:59" (1/1) ... [2021-11-21 00:47:59,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@668eaf3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:59, skipping insertion in model container [2021-11-21 00:47:59,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:47:59" (1/1) ... [2021-11-21 00:47:59,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 00:47:59,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 00:47:59,423 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_ee8f3123-6674-4e2d-b732-3927dbeb6574/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound20.c[712,725] [2021-11-21 00:47:59,441 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:47:59,449 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 00:47:59,462 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_ee8f3123-6674-4e2d-b732-3927dbeb6574/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound20.c[712,725] [2021-11-21 00:47:59,467 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:47:59,480 INFO L208 MainTranslator]: Completed translation [2021-11-21 00:47:59,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:59 WrapperNode [2021-11-21 00:47:59,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 00:47:59,482 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 00:47:59,483 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 00:47:59,483 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 00:47:59,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:59" (1/1) ... [2021-11-21 00:47:59,498 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:59" (1/1) ... [2021-11-21 00:47:59,517 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2021-11-21 00:47:59,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 00:47:59,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 00:47:59,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 00:47:59,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 00:47:59,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:59" (1/1) ... [2021-11-21 00:47:59,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:59" (1/1) ... [2021-11-21 00:47:59,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:59" (1/1) ... [2021-11-21 00:47:59,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:59" (1/1) ... [2021-11-21 00:47:59,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:59" (1/1) ... [2021-11-21 00:47:59,544 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:59" (1/1) ... [2021-11-21 00:47:59,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:59" (1/1) ... [2021-11-21 00:47:59,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 00:47:59,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 00:47:59,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 00:47:59,548 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 00:47:59,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:59" (1/1) ... [2021-11-21 00:47:59,560 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:47:59,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:47:59,579 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 00:47:59,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 00:47:59,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 00:47:59,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-21 00:47:59,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 00:47:59,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 00:47:59,617 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-21 00:47:59,617 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-21 00:47:59,667 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 00:47:59,668 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 00:47:59,763 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 00:47:59,775 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 00:47:59,776 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-21 00:47:59,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:47:59 BoogieIcfgContainer [2021-11-21 00:47:59,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 00:47:59,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 00:47:59,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 00:47:59,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 00:47:59,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:47:59" (1/3) ... [2021-11-21 00:47:59,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282d68ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:47:59, skipping insertion in model container [2021-11-21 00:47:59,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:47:59" (2/3) ... [2021-11-21 00:47:59,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282d68ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:47:59, skipping insertion in model container [2021-11-21 00:47:59,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:47:59" (3/3) ... [2021-11-21 00:47:59,787 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_unwindbound20.c [2021-11-21 00:47:59,792 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 00:47:59,793 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-21 00:47:59,841 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 00:47:59,849 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=FINITE_AUTOMATA, 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-11-21 00:47:59,850 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-21 00:47:59,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:47:59,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-21 00:47:59,872 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:47:59,873 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-21 00:47:59,873 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:47:59,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:47:59,879 INFO L85 PathProgramCache]: Analyzing trace with hash 2109616992, now seen corresponding path program 1 times [2021-11-21 00:47:59,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:47:59,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550157489] [2021-11-21 00:47:59,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:47:59,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:47:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:48:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:48:00,092 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:48:00,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550157489] [2021-11-21 00:48:00,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550157489] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:48:00,094 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:48:00,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 00:48:00,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70086691] [2021-11-21 00:48:00,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:48:00,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-21 00:48:00,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:48:00,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-21 00:48:00,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-21 00:48:00,160 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:48:00,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:48:00,227 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2021-11-21 00:48:00,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-21 00:48:00,229 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-11-21 00:48:00,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:48:00,237 INFO L225 Difference]: With dead ends: 27 [2021-11-21 00:48:00,237 INFO L226 Difference]: Without dead ends: 12 [2021-11-21 00:48:00,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-21 00:48:00,245 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:48:00,246 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 00:48:00,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-11-21 00:48:00,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-11-21 00:48:00,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 00:48:00,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2021-11-21 00:48:00,283 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2021-11-21 00:48:00,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:48:00,284 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2021-11-21 00:48:00,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:48:00,285 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2021-11-21 00:48:00,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-21 00:48:00,285 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:48:00,286 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:48:00,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 00:48:00,287 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:48:00,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:48:00,288 INFO L85 PathProgramCache]: Analyzing trace with hash 574117089, now seen corresponding path program 1 times [2021-11-21 00:48:00,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:48:00,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526243334] [2021-11-21 00:48:00,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:48:00,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:48:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:48:00,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:48:00,357 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:48:00,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526243334] [2021-11-21 00:48:00,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526243334] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:48:00,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:48:00,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-21 00:48:00,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431828970] [2021-11-21 00:48:00,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:48:00,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 00:48:00,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:48:00,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 00:48:00,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-21 00:48:00,362 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:48:00,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:48:00,398 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2021-11-21 00:48:00,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-21 00:48:00,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-21 00:48:00,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:48:00,400 INFO L225 Difference]: With dead ends: 21 [2021-11-21 00:48:00,400 INFO L226 Difference]: Without dead ends: 14 [2021-11-21 00:48:00,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-21 00:48:00,403 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:48:00,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 00:48:00,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-11-21 00:48:00,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-11-21 00:48:00,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 00:48:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-11-21 00:48:00,409 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2021-11-21 00:48:00,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:48:00,409 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-11-21 00:48:00,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:48:00,410 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2021-11-21 00:48:00,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-21 00:48:00,411 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:48:00,411 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:48:00,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-21 00:48:00,411 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:48:00,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:48:00,413 INFO L85 PathProgramCache]: Analyzing trace with hash 575904549, now seen corresponding path program 1 times [2021-11-21 00:48:00,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:48:00,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940256903] [2021-11-21 00:48:00,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:48:00,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:48:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-21 00:48:00,450 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-21 00:48:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-21 00:48:00,499 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-21 00:48:00,499 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-21 00:48:00,501 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-21 00:48:00,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-21 00:48:00,508 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-11-21 00:48:00,514 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-21 00:48:00,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 12:48:00 BoogieIcfgContainer [2021-11-21 00:48:00,547 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-21 00:48:00,550 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-21 00:48:00,550 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-21 00:48:00,551 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-21 00:48:00,551 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:47:59" (3/4) ... [2021-11-21 00:48:00,555 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-21 00:48:00,555 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-21 00:48:00,557 INFO L158 Benchmark]: Toolchain (without parser) took 1353.63ms. Allocated memory was 88.1MB in the beginning and 109.1MB in the end (delta: 21.0MB). Free memory was 65.7MB in the beginning and 68.5MB in the end (delta: -2.8MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2021-11-21 00:48:00,558 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 88.1MB. Free memory was 63.7MB in the beginning and 63.6MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:48:00,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.90ms. Allocated memory is still 88.1MB. Free memory was 65.7MB in the beginning and 64.1MB in the end (delta: 1.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-21 00:48:00,567 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.07ms. Allocated memory is still 88.1MB. Free memory was 64.0MB in the beginning and 62.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 00:48:00,567 INFO L158 Benchmark]: Boogie Preprocessor took 26.88ms. Allocated memory is still 88.1MB. Free memory was 62.5MB in the beginning and 61.5MB in the end (delta: 979.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:48:00,570 INFO L158 Benchmark]: RCFGBuilder took 230.65ms. Allocated memory is still 88.1MB. Free memory was 61.5MB in the beginning and 52.7MB in the end (delta: 8.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-21 00:48:00,572 INFO L158 Benchmark]: TraceAbstraction took 767.00ms. Allocated memory was 88.1MB in the beginning and 109.1MB in the end (delta: 21.0MB). Free memory was 52.2MB in the beginning and 68.5MB in the end (delta: -16.4MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2021-11-21 00:48:00,573 INFO L158 Benchmark]: Witness Printer took 5.35ms. Allocated memory is still 109.1MB. Free memory is still 68.5MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:48:00,576 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.28ms. Allocated memory is still 88.1MB. Free memory was 63.7MB in the beginning and 63.6MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.90ms. Allocated memory is still 88.1MB. Free memory was 65.7MB in the beginning and 64.1MB in the end (delta: 1.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.07ms. Allocated memory is still 88.1MB. Free memory was 64.0MB in the beginning and 62.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.88ms. Allocated memory is still 88.1MB. Free memory was 62.5MB in the beginning and 61.5MB in the end (delta: 979.6kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 230.65ms. Allocated memory is still 88.1MB. Free memory was 61.5MB in the beginning and 52.7MB in the end (delta: 8.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 767.00ms. Allocated memory was 88.1MB in the beginning and 109.1MB in the end (delta: 21.0MB). Free memory was 52.2MB in the beginning and 68.5MB in the end (delta: -16.4MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Witness Printer took 5.35ms. Allocated memory is still 109.1MB. Free memory is still 68.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_int at line 33, overapproximation of someBinaryArithmeticDOUBLEoperation at line 29. Possible FailurePath: [L24] int counter = 0; [L26] int r; [L27] double a, x; [L28] a = __VERIFIER_nondet_double() [L29] x = a / 2.0 [L30] r = 0 VAL [counter=0, r=0] [L32] EXPR counter++ VAL [counter=1, counter++=0, r=0] [L32] COND TRUE counter++<20 [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0, counter=1] [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=1] [L19] reach_error() VAL [\old(cond)=0, cond=0, counter=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 25 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-11-21 00:48:00,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/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_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound20.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 290432887833d1264fa39f327d8609faf39248fe680017022e16e5c72d0bf2b6 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 00:48:03,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 00:48:03,091 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 00:48:03,130 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 00:48:03,131 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 00:48:03,135 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 00:48:03,141 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 00:48:03,145 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 00:48:03,148 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 00:48:03,157 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 00:48:03,158 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 00:48:03,160 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 00:48:03,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 00:48:03,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 00:48:03,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 00:48:03,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 00:48:03,173 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 00:48:03,175 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 00:48:03,177 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 00:48:03,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 00:48:03,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 00:48:03,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 00:48:03,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 00:48:03,193 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 00:48:03,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 00:48:03,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 00:48:03,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 00:48:03,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 00:48:03,208 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 00:48:03,209 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 00:48:03,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 00:48:03,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 00:48:03,213 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 00:48:03,214 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 00:48:03,216 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 00:48:03,216 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 00:48:03,217 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 00:48:03,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 00:48:03,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 00:48:03,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 00:48:03,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 00:48:03,222 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-21 00:48:03,266 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 00:48:03,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 00:48:03,267 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 00:48:03,268 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 00:48:03,269 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 00:48:03,269 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 00:48:03,269 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 00:48:03,269 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 00:48:03,270 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 00:48:03,270 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 00:48:03,271 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 00:48:03,271 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 00:48:03,273 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 00:48:03,273 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 00:48:03,273 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 00:48:03,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 00:48:03,273 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 00:48:03,274 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 00:48:03,274 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 00:48:03,274 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-21 00:48:03,274 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-21 00:48:03,275 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 00:48:03,275 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 00:48:03,275 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 00:48:03,275 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 00:48:03,275 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 00:48:03,276 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-21 00:48:03,276 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 00:48:03,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:48:03,276 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 00:48:03,277 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 00:48:03,277 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 00:48:03,277 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-21 00:48:03,278 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-21 00:48:03,278 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 00:48:03,278 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 00:48:03,278 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 00:48:03,279 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_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/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_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P 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 -> Taipan 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 -> 290432887833d1264fa39f327d8609faf39248fe680017022e16e5c72d0bf2b6 [2021-11-21 00:48:03,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 00:48:03,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 00:48:03,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 00:48:03,649 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 00:48:03,663 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 00:48:03,664 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound20.c [2021-11-21 00:48:03,744 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/data/6f3b325dd/e1771833a73e46bcbecfbc53da3a0f97/FLAG951403f0f [2021-11-21 00:48:04,294 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 00:48:04,295 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound20.c [2021-11-21 00:48:04,302 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/data/6f3b325dd/e1771833a73e46bcbecfbc53da3a0f97/FLAG951403f0f [2021-11-21 00:48:04,673 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/data/6f3b325dd/e1771833a73e46bcbecfbc53da3a0f97 [2021-11-21 00:48:04,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 00:48:04,678 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 00:48:04,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 00:48:04,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 00:48:04,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 00:48:04,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:48:04" (1/1) ... [2021-11-21 00:48:04,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28d58123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:04, skipping insertion in model container [2021-11-21 00:48:04,700 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:48:04" (1/1) ... [2021-11-21 00:48:04,707 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 00:48:04,728 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 00:48:04,863 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_ee8f3123-6674-4e2d-b732-3927dbeb6574/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound20.c[712,725] [2021-11-21 00:48:04,893 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:48:04,916 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 00:48:04,932 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_ee8f3123-6674-4e2d-b732-3927dbeb6574/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound20.c[712,725] [2021-11-21 00:48:04,965 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:48:04,978 INFO L208 MainTranslator]: Completed translation [2021-11-21 00:48:04,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:04 WrapperNode [2021-11-21 00:48:04,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 00:48:04,980 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 00:48:04,980 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 00:48:04,980 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 00:48:04,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:04" (1/1) ... [2021-11-21 00:48:05,006 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:04" (1/1) ... [2021-11-21 00:48:05,025 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 35 [2021-11-21 00:48:05,026 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 00:48:05,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 00:48:05,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 00:48:05,027 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 00:48:05,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:04" (1/1) ... [2021-11-21 00:48:05,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:04" (1/1) ... [2021-11-21 00:48:05,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:04" (1/1) ... [2021-11-21 00:48:05,043 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:04" (1/1) ... [2021-11-21 00:48:05,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:04" (1/1) ... [2021-11-21 00:48:05,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:04" (1/1) ... [2021-11-21 00:48:05,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:04" (1/1) ... [2021-11-21 00:48:05,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 00:48:05,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 00:48:05,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 00:48:05,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 00:48:05,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:04" (1/1) ... [2021-11-21 00:48:05,082 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:48:05,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:48:05,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 00:48:05,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 00:48:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 00:48:05,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-21 00:48:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 00:48:05,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 00:48:05,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-21 00:48:05,160 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-21 00:48:05,240 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 00:48:05,242 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 00:48:06,352 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 00:48:06,366 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 00:48:06,366 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-21 00:48:06,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:48:06 BoogieIcfgContainer [2021-11-21 00:48:06,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 00:48:06,370 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 00:48:06,370 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 00:48:06,373 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 00:48:06,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:48:04" (1/3) ... [2021-11-21 00:48:06,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d912689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:48:06, skipping insertion in model container [2021-11-21 00:48:06,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:48:04" (2/3) ... [2021-11-21 00:48:06,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d912689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:48:06, skipping insertion in model container [2021-11-21 00:48:06,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:48:06" (3/3) ... [2021-11-21 00:48:06,377 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_unwindbound20.c [2021-11-21 00:48:06,383 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 00:48:06,383 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-21 00:48:06,447 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 00:48:06,455 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=FINITE_AUTOMATA, 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-11-21 00:48:06,455 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-21 00:48:06,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:48:06,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-21 00:48:06,478 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:48:06,478 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:48:06,479 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:48:06,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:48:06,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1819757606, now seen corresponding path program 1 times [2021-11-21 00:48:06,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:48:06,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39699642] [2021-11-21 00:48:06,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:48:06,499 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:48:06,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:48:06,505 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:48:06,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-21 00:48:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:48:06,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-21 00:48:06,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:48:06,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:48:06,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:48:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:48:07,026 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:48:07,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39699642] [2021-11-21 00:48:07,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [39699642] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:48:07,027 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:48:07,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-21 00:48:07,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187918876] [2021-11-21 00:48:07,030 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:48:07,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-21 00:48:07,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:48:07,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-21 00:48:07,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-21 00:48:07,076 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:48:07,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:48:07,096 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2021-11-21 00:48:07,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-21 00:48:07,098 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-11-21 00:48:07,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:48:07,105 INFO L225 Difference]: With dead ends: 32 [2021-11-21 00:48:07,106 INFO L226 Difference]: Without dead ends: 13 [2021-11-21 00:48:07,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-21 00:48:07,113 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-21 00:48:07,114 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-21 00:48:07,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-21 00:48:07,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-11-21 00:48:07,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-11-21 00:48:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-11-21 00:48:07,149 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2021-11-21 00:48:07,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:48:07,150 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-11-21 00:48:07,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:48:07,150 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-11-21 00:48:07,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-21 00:48:07,151 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:48:07,151 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:48:07,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-21 00:48:07,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:48:07,372 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:48:07,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:48:07,373 INFO L85 PathProgramCache]: Analyzing trace with hash 178410715, now seen corresponding path program 1 times [2021-11-21 00:48:07,374 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:48:07,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1648950013] [2021-11-21 00:48:07,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:48:07,374 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:48:07,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:48:07,376 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:48:07,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-21 00:48:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:48:07,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-21 00:48:07,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:48:07,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:48:07,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:48:07,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:48:07,971 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:48:07,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1648950013] [2021-11-21 00:48:07,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1648950013] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:48:07,972 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:48:07,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-11-21 00:48:07,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501314666] [2021-11-21 00:48:07,972 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:48:07,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 00:48:07,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:48:07,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 00:48:07,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-21 00:48:07,975 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:48:10,716 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 00:48:12,900 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 00:48:15,068 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 00:48:15,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:48:15,140 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-11-21 00:48:15,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:48:15,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-21 00:48:15,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:48:15,142 INFO L225 Difference]: With dead ends: 33 [2021-11-21 00:48:15,142 INFO L226 Difference]: Without dead ends: 26 [2021-11-21 00:48:15,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-11-21 00:48:15,144 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2021-11-21 00:48:15,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 44 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 3 Unknown, 0 Unchecked, 7.1s Time] [2021-11-21 00:48:15,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-21 00:48:15,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2021-11-21 00:48:15,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 19 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:48:15,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-11-21 00:48:15,150 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 8 [2021-11-21 00:48:15,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:48:15,155 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-11-21 00:48:15,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:48:15,155 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-11-21 00:48:15,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-21 00:48:15,156 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:48:15,156 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:48:15,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-21 00:48:15,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:48:15,359 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:48:15,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:48:15,359 INFO L85 PathProgramCache]: Analyzing trace with hash 180198175, now seen corresponding path program 1 times [2021-11-21 00:48:15,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:48:15,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359718452] [2021-11-21 00:48:15,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:48:15,361 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:48:15,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:48:15,362 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:48:15,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-21 00:48:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:48:17,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-21 00:48:17,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:48:40,172 WARN L838 $PredicateComparison]: unable to prove that (or (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) is different from false [2021-11-21 00:48:46,792 WARN L838 $PredicateComparison]: unable to prove that (or (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (= c___VERIFIER_assert_~cond (_ bv0 32))) (= c___VERIFIER_assert_~cond (_ bv1 32))) is different from false [2021-11-21 00:48:54,997 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) is different from false [2021-11-21 00:48:57,035 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) is different from true [2021-11-21 00:48:57,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:48:57,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:49:04,498 WARN L838 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2021-11-21 00:49:06,552 WARN L860 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2021-11-21 00:49:20,957 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_9| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_9|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_9| ((_ to_fp 11 53) c_currentRoundingMode 2.0))))) (_ bv0 32))) is different from false [2021-11-21 00:49:23,003 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_9| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_9|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_9| ((_ to_fp 11 53) c_currentRoundingMode 2.0))))) (_ bv0 32))) is different from true [2021-11-21 00:49:23,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-21 00:49:23,004 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:49:23,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359718452] [2021-11-21 00:49:23,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1359718452] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:49:23,005 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:49:23,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 10 [2021-11-21 00:49:23,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118756047] [2021-11-21 00:49:23,005 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:49:23,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-21 00:49:23,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:49:23,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-21 00:49:23,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=8, NotChecked=60, Total=110 [2021-11-21 00:49:23,007 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:49:25,121 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~a~0#1_9| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_9|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_9| ((_ to_fp 11 53) c_currentRoundingMode 2.0))))) (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-21 00:49:27,169 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~a~0#1_9| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_9|) .cse0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_9| ((_ to_fp 11 53) c_currentRoundingMode 2.0))))) (_ bv0 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-21 00:49:29,216 WARN L838 $PredicateComparison]: unable to prove that (and (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) (= |c_ULTIMATE.start_main_~r~0#1| (_ bv0 32)) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-11-21 00:49:31,271 WARN L860 $PredicateComparison]: unable to prove that (and (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) (= |c_ULTIMATE.start_main_~r~0#1| (_ bv0 32)) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-11-21 00:49:40,314 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 00:49:40,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:49:40,385 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2021-11-21 00:49:40,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-21 00:49:40,386 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-21 00:49:40,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:49:40,387 INFO L225 Difference]: With dead ends: 30 [2021-11-21 00:49:40,387 INFO L226 Difference]: Without dead ends: 26 [2021-11-21 00:49:40,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 32.9s TimeCoverageRelationStatistics Valid=36, Invalid=52, Unknown=12, NotChecked=140, Total=240 [2021-11-21 00:49:40,390 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2021-11-21 00:49:40,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 51 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 1 Unknown, 49 Unchecked, 4.8s Time] [2021-11-21 00:49:40,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-21 00:49:40,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-11-21 00:49:40,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:49:40,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2021-11-21 00:49:40,399 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 8 [2021-11-21 00:49:40,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:49:40,400 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2021-11-21 00:49:40,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-21 00:49:40,401 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2021-11-21 00:49:40,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-21 00:49:40,401 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:49:40,402 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:49:40,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-11-21 00:49:40,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:49:40,607 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:49:40,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:49:40,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1780785341, now seen corresponding path program 1 times [2021-11-21 00:49:40,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:49:40,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142029582] [2021-11-21 00:49:40,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:49:40,609 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:49:40,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:49:40,611 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:49:40,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-21 00:49:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:49:40,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-21 00:49:40,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:49:47,226 WARN L838 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2021-11-21 00:49:49,287 WARN L860 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2021-11-21 00:50:01,674 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) is different from false [2021-11-21 00:50:09,949 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= c___VERIFIER_assert_~cond (_ bv1 32))) is different from false [2021-11-21 00:50:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-21 00:50:09,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:50:34,922 WARN L227 SmtUtils]: Spent 16.63s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-21 00:50:51,587 WARN L227 SmtUtils]: Spent 16.66s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 268] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-21 00:50:59,886 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2021-11-21 00:51:14,387 WARN L860 $PredicateComparison]: unable to prove that (or (= c___VERIFIER_assert_~cond (_ bv0 32)) (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2021-11-21 00:51:14,400 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-21 00:51:14,401 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:51:14,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142029582] [2021-11-21 00:51:14,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142029582] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:51:14,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1675583762] [2021-11-21 00:51:14,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:51:14,402 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 00:51:14,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 00:51:14,407 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 00:51:14,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2021-11-21 00:51:14,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:51:14,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-21 00:51:14,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:51:31,115 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) is different from false [2021-11-21 00:51:39,389 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (= c___VERIFIER_assert_~cond (_ bv1 32))) is different from false [2021-11-21 00:51:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-21 00:51:39,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:52:04,385 WARN L227 SmtUtils]: Spent 16.66s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-21 00:52:21,037 WARN L227 SmtUtils]: Spent 16.65s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 268] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-21 00:52:29,347 WARN L860 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))))) is different from true [2021-11-21 00:52:43,859 WARN L860 $PredicateComparison]: unable to prove that (or (= c___VERIFIER_assert_~cond (_ bv0 32)) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))))) is different from true [2021-11-21 00:52:43,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-21 00:52:43,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1675583762] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:52:43,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038959376] [2021-11-21 00:52:43,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:52:43,870 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:52:43,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:52:43,875 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:52:43,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-21 00:52:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:52:44,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-21 00:52:44,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:53:00,677 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) is different from false [2021-11-21 00:53:08,955 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))) (= c___VERIFIER_assert_~cond (_ bv1 32))) is different from false [2021-11-21 00:53:08,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-21 00:53:08,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:53:33,733 WARN L227 SmtUtils]: Spent 16.46s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 231] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-21 00:53:50,279 WARN L227 SmtUtils]: Spent 16.54s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 268] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-11-21 00:53:58,571 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2021-11-21 00:54:13,092 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) (= c___VERIFIER_assert_~cond (_ bv0 32)) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2021-11-21 00:54:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-11-21 00:54:13,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038959376] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:54:13,114 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-21 00:54:13,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7, 7] total 18 [2021-11-21 00:54:13,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938884121] [2021-11-21 00:54:13,114 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-21 00:54:13,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-21 00:54:13,115 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:54:13,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-21 00:54:13,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=25, Unknown=14, NotChecked=234, Total=306 [2021-11-21 00:54:13,117 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-21 00:54:15,304 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 00:54:17,309 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 00:54:19,579 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= c___VERIFIER_assert_~cond (_ bv0 32))) (.cse1 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (= c___VERIFIER_assert_~cond |c___VERIFIER_assert_#in~cond|) (or .cse0 .cse1 (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) .cse0 .cse1) (or .cse0 (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse1))) is different from true [2021-11-21 00:54:21,768 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) .cse0) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse0) (or .cse0 (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))))) .cse0)) is different from true [2021-11-21 00:54:23,968 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) is different from false [2021-11-21 00:54:26,169 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c___VERIFIER_assert_~cond (_ bv0 32))) (.cse1 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (= c___VERIFIER_assert_~cond |c___VERIFIER_assert_#in~cond|) (not .cse0) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (or .cse0 .cse1 (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))))) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) .cse0 .cse1) (or .cse0 (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse1) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))) (= c___VERIFIER_assert_~cond (_ bv1 32)))) is different from false [2021-11-21 00:54:28,344 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= c___VERIFIER_assert_~cond (_ bv0 32))) (.cse1 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (= c___VERIFIER_assert_~cond |c___VERIFIER_assert_#in~cond|) (not .cse0) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_4|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_4|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_4|))) (_ bv0 32))) (or .cse0 .cse1 (forall ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_5|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_5|)))))) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_7|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_7|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_7|))) (_ bv0 32))) .cse0 .cse1) (or .cse0 (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse1) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| (_ BitVec 32)) (|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6| (_ FloatingPoint 11 53))) (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_6|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_6|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_6|))))) (= c___VERIFIER_assert_~cond (_ bv1 32)))) is different from true [2021-11-21 00:54:28,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:54:28,347 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2021-11-21 00:54:28,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-21 00:54:28,348 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 14 [2021-11-21 00:54:28,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:54:28,349 INFO L225 Difference]: With dead ends: 31 [2021-11-21 00:54:28,349 INFO L226 Difference]: Without dead ends: 23 [2021-11-21 00:54:28,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=41, Invalid=28, Unknown=19, NotChecked=374, Total=462 [2021-11-21 00:54:28,351 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2021-11-21 00:54:28,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 2 Unknown, 90 Unchecked, 4.3s Time] [2021-11-21 00:54:28,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-11-21 00:54:28,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-11-21 00:54:28,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-11-21 00:54:28,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-11-21 00:54:28,368 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 14 [2021-11-21 00:54:28,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:54:28,368 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-11-21 00:54:28,369 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 15 states have internal predecessors, (26), 2 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-11-21 00:54:28,369 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2021-11-21 00:54:28,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-21 00:54:28,371 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:54:28,371 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:54:28,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-21 00:54:28,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2021-11-21 00:54:28,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-11-21 00:54:28,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:54:28,992 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:54:28,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:54:28,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1540611354, now seen corresponding path program 1 times [2021-11-21 00:54:28,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:54:28,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858611546] [2021-11-21 00:54:28,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:54:28,993 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:54:28,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:54:28,994 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:54:28,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-21 00:54:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-21 00:54:34,293 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-21 00:54:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-21 00:54:45,792 INFO L133 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2021-11-21 00:54:45,793 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-21 00:54:45,794 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-21 00:54:45,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-21 00:54:45,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:54:45,999 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2021-11-21 00:54:46,001 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-21 00:54:46,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 12:54:46 BoogieIcfgContainer [2021-11-21 00:54:46,026 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-21 00:54:46,027 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-21 00:54:46,027 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-21 00:54:46,027 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-21 00:54:46,028 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:48:06" (3/4) ... [2021-11-21 00:54:46,029 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-21 00:54:46,076 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/witness.graphml [2021-11-21 00:54:46,076 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-21 00:54:46,077 INFO L158 Benchmark]: Toolchain (without parser) took 401399.46ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 35.0MB in the beginning and 50.1MB in the end (delta: -15.1MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2021-11-21 00:54:46,077 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 38.1MB in the beginning and 38.1MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:54:46,078 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.16ms. Allocated memory is still 56.6MB. Free memory was 34.9MB in the beginning and 39.1MB in the end (delta: -4.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-11-21 00:54:46,078 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.13ms. Allocated memory is still 56.6MB. Free memory was 39.1MB in the beginning and 37.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:54:46,079 INFO L158 Benchmark]: Boogie Preprocessor took 43.72ms. Allocated memory is still 56.6MB. Free memory was 37.4MB in the beginning and 36.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 00:54:46,079 INFO L158 Benchmark]: RCFGBuilder took 1296.65ms. Allocated memory is still 56.6MB. Free memory was 36.3MB in the beginning and 27.5MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-21 00:54:46,080 INFO L158 Benchmark]: TraceAbstraction took 399656.11ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 27.2MB in the beginning and 24.9MB in the end (delta: 2.3MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2021-11-21 00:54:46,080 INFO L158 Benchmark]: Witness Printer took 49.80ms. Allocated memory is still 69.2MB. Free memory was 24.9MB in the beginning and 50.1MB in the end (delta: -25.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 00:54:46,095 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.16ms. Allocated memory is still 56.6MB. Free memory was 38.1MB in the beginning and 38.1MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.16ms. Allocated memory is still 56.6MB. Free memory was 34.9MB in the beginning and 39.1MB in the end (delta: -4.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.13ms. Allocated memory is still 56.6MB. Free memory was 39.1MB in the beginning and 37.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.72ms. Allocated memory is still 56.6MB. Free memory was 37.4MB in the beginning and 36.3MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1296.65ms. Allocated memory is still 56.6MB. Free memory was 36.3MB in the beginning and 27.5MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 399656.11ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 27.2MB in the beginning and 24.9MB in the end (delta: 2.3MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * Witness Printer took 49.80ms. Allocated memory is still 69.2MB. Free memory was 24.9MB in the beginning and 50.1MB in the end (delta: -25.2MB). Peak memory consumption was 2.1MB. 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 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int counter = 0; VAL [counter=0] [L26] int r; [L27] double a, x; [L28] a = __VERIFIER_nondet_double() [L29] x = a / 2.0 [L30] r = 0 VAL [a=10977524194541606, counter=0, r=0, x=5488762097270803] [L32] EXPR counter++ VAL [a=10977524194541606, counter=1, counter++=0, r=0, x=5488762097270803] [L32] COND TRUE counter++<20 [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=1, counter=1] [L17] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L33] RET __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [a=10977524194541606, counter=1, r=0, x=5488762097270803] [L35] COND FALSE !(!(x > r)) [L37] x = x - r [L38] r = r + 1 VAL [a=10977524194541606, counter=1, r=1, x=5488762097270803] [L32] EXPR counter++ VAL [a=10977524194541606, counter=2, counter++=1, r=1, x=5488762097270803] [L32] COND TRUE counter++<20 [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0, counter=2] [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=2] [L19] reach_error() VAL [\old(cond)=0, cond=0, counter=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 399.6s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 39.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 16 SdHoareTripleChecker+Valid, 16.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 181 SdHoareTripleChecker+Invalid, 15.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 139 IncrementalHoareTripleChecker+Unchecked, 130 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 51 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 72.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=3, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 9.0s SatisfiabilityAnalysisTime, 337.3s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 118 ConstructedInterpolants, 19 QuantifiedInterpolants, 1166 SizeOfPredicates, 15 NumberOfNonLiveVariables, 184 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 6/12 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 proved your program to be incorrect! [2021-11-21 00:54:46,322 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-21 00:54:46,327 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ee8f3123-6674-4e2d-b732-3927dbeb6574/bin/utaipan-TEXQjIfE4P/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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE