./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound100.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_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/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_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound100.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/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_01164b4f-6960-41d8-a32c-f34920b2d79f/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 f78eb3bd6243e56025d38ea44716c81630a57505e69e1c5e81a8ab68f6ac9a28 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 00:44:25,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 00:44:25,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 00:44:25,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 00:44:25,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 00:44:25,297 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 00:44:25,299 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 00:44:25,303 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 00:44:25,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 00:44:25,313 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 00:44:25,314 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 00:44:25,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 00:44:25,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 00:44:25,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 00:44:25,322 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 00:44:25,328 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 00:44:25,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 00:44:25,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 00:44:25,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 00:44:25,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 00:44:25,347 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 00:44:25,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 00:44:25,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 00:44:25,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 00:44:25,359 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 00:44:25,360 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 00:44:25,360 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 00:44:25,363 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 00:44:25,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 00:44:25,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 00:44:25,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 00:44:25,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 00:44:25,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 00:44:25,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 00:44:25,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 00:44:25,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 00:44:25,373 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 00:44:25,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 00:44:25,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 00:44:25,374 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 00:44:25,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 00:44:25,376 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-21 00:44:25,428 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 00:44:25,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 00:44:25,429 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 00:44:25,429 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 00:44:25,430 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 00:44:25,430 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 00:44:25,431 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 00:44:25,431 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 00:44:25,431 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 00:44:25,432 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-21 00:44:25,433 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 00:44:25,433 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 00:44:25,433 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-21 00:44:25,434 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-21 00:44:25,434 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 00:44:25,434 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-21 00:44:25,435 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-21 00:44:25,435 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-21 00:44:25,436 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 00:44:25,436 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 00:44:25,436 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-21 00:44:25,436 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 00:44:25,437 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 00:44:25,437 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 00:44:25,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 00:44:25,437 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 00:44:25,439 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 00:44:25,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 00:44:25,440 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 00:44:25,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 00:44:25,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 00:44:25,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 00:44:25,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:44:25,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 00:44:25,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 00:44:25,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 00:44:25,442 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-21 00:44:25,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-21 00:44:25,443 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 00:44:25,443 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 00:44:25,443 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 00:44:25,444 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_01164b4f-6960-41d8-a32c-f34920b2d79f/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_01164b4f-6960-41d8-a32c-f34920b2d79f/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 -> f78eb3bd6243e56025d38ea44716c81630a57505e69e1c5e81a8ab68f6ac9a28 [2021-11-21 00:44:25,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 00:44:25,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 00:44:25,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 00:44:25,796 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 00:44:25,797 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 00:44:25,798 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound100.c [2021-11-21 00:44:25,881 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/data/aeaba5773/2a55d08faeb04e42a963f38fd8912694/FLAGeb3e937ce [2021-11-21 00:44:26,309 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 00:44:26,310 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound100.c [2021-11-21 00:44:26,316 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/data/aeaba5773/2a55d08faeb04e42a963f38fd8912694/FLAGeb3e937ce [2021-11-21 00:44:26,705 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/data/aeaba5773/2a55d08faeb04e42a963f38fd8912694 [2021-11-21 00:44:26,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 00:44:26,709 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 00:44:26,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 00:44:26,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 00:44:26,714 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 00:44:26,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:44:26" (1/1) ... [2021-11-21 00:44:26,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@581f05c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:26, skipping insertion in model container [2021-11-21 00:44:26,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:44:26" (1/1) ... [2021-11-21 00:44:26,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 00:44:26,737 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 00:44:26,882 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_01164b4f-6960-41d8-a32c-f34920b2d79f/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound100.c[712,725] [2021-11-21 00:44:26,910 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:44:26,924 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 00:44:26,941 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_01164b4f-6960-41d8-a32c-f34920b2d79f/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound100.c[712,725] [2021-11-21 00:44:26,952 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:44:26,968 INFO L208 MainTranslator]: Completed translation [2021-11-21 00:44:26,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:26 WrapperNode [2021-11-21 00:44:26,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 00:44:26,970 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 00:44:26,970 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 00:44:26,971 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 00:44:26,978 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:44:26" (1/1) ... [2021-11-21 00:44:26,985 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:44:26" (1/1) ... [2021-11-21 00:44:27,002 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2021-11-21 00:44:27,002 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 00:44:27,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 00:44:27,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 00:44:27,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 00:44:27,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:26" (1/1) ... [2021-11-21 00:44:27,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:26" (1/1) ... [2021-11-21 00:44:27,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:26" (1/1) ... [2021-11-21 00:44:27,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:26" (1/1) ... [2021-11-21 00:44:27,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:26" (1/1) ... [2021-11-21 00:44:27,021 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:26" (1/1) ... [2021-11-21 00:44:27,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:26" (1/1) ... [2021-11-21 00:44:27,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 00:44:27,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 00:44:27,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 00:44:27,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 00:44:27,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:26" (1/1) ... [2021-11-21 00:44:27,034 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:44:27,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:44:27,059 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 00:44:27,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 00:44:27,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 00:44:27,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-21 00:44:27,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 00:44:27,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 00:44:27,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-21 00:44:27,106 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-21 00:44:27,172 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 00:44:27,174 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 00:44:27,281 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 00:44:27,293 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 00:44:27,293 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-21 00:44:27,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:44:27 BoogieIcfgContainer [2021-11-21 00:44:27,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 00:44:27,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 00:44:27,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 00:44:27,301 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 00:44:27,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:44:26" (1/3) ... [2021-11-21 00:44:27,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dfcc4c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:44:27, skipping insertion in model container [2021-11-21 00:44:27,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:26" (2/3) ... [2021-11-21 00:44:27,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dfcc4c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:44:27, skipping insertion in model container [2021-11-21 00:44:27,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:44:27" (3/3) ... [2021-11-21 00:44:27,304 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_unwindbound100.c [2021-11-21 00:44:27,309 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 00:44:27,309 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-21 00:44:27,356 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 00:44:27,363 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:44:27,364 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-21 00:44:27,406 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:44:27,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-21 00:44:27,411 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:44:27,412 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-21 00:44:27,412 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:44:27,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:44:27,422 INFO L85 PathProgramCache]: Analyzing trace with hash 2109616992, now seen corresponding path program 1 times [2021-11-21 00:44:27,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:44:27,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163249657] [2021-11-21 00:44:27,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:44:27,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:44:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:44:27,571 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:44:27,573 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:44:27,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163249657] [2021-11-21 00:44:27,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163249657] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:44:27,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:44:27,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-21 00:44:27,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239210776] [2021-11-21 00:44:27,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:44:27,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-21 00:44:27,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:44:27,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-21 00:44:27,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-21 00:44:27,644 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:44:27,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:44:27,670 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2021-11-21 00:44:27,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-21 00:44:27,673 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:44:27,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:44:27,681 INFO L225 Difference]: With dead ends: 27 [2021-11-21 00:44:27,681 INFO L226 Difference]: Without dead ends: 12 [2021-11-21 00:44:27,684 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:44:27,688 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:44:27,690 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:44:27,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-11-21 00:44:27,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-11-21 00:44:27,723 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:44:27,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2021-11-21 00:44:27,725 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2021-11-21 00:44:27,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:44:27,726 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2021-11-21 00:44:27,726 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:44:27,726 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2021-11-21 00:44:27,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-21 00:44:27,727 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:44:27,727 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:44:27,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-21 00:44:27,728 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:44:27,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:44:27,729 INFO L85 PathProgramCache]: Analyzing trace with hash 574117089, now seen corresponding path program 1 times [2021-11-21 00:44:27,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:44:27,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953888031] [2021-11-21 00:44:27,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:44:27,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:44:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:44:27,794 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:44:27,795 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-21 00:44:27,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953888031] [2021-11-21 00:44:27,795 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953888031] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-21 00:44:27,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:44:27,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-21 00:44:27,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51305995] [2021-11-21 00:44:27,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-21 00:44:27,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-21 00:44:27,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-21 00:44:27,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-21 00:44:27,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-21 00:44:27,800 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:44:27,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:44:27,822 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2021-11-21 00:44:27,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-21 00:44:27,823 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:44:27,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:44:27,824 INFO L225 Difference]: With dead ends: 21 [2021-11-21 00:44:27,824 INFO L226 Difference]: Without dead ends: 14 [2021-11-21 00:44:27,825 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:44:27,827 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:44:27,828 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:44:27,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-11-21 00:44:27,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-11-21 00:44:27,834 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:44:27,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2021-11-21 00:44:27,835 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2021-11-21 00:44:27,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:44:27,836 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-11-21 00:44:27,836 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:44:27,836 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2021-11-21 00:44:27,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-21 00:44:27,837 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:44:27,837 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:44:27,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-21 00:44:27,838 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:44:27,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:44:27,839 INFO L85 PathProgramCache]: Analyzing trace with hash 575904549, now seen corresponding path program 1 times [2021-11-21 00:44:27,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-21 00:44:27,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783246211] [2021-11-21 00:44:27,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:44:27,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-21 00:44:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-21 00:44:27,859 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-21 00:44:27,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-21 00:44:27,896 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-21 00:44:27,898 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-21 00:44:27,899 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-21 00:44:27,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-21 00:44:27,907 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-11-21 00:44:27,913 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-21 00:44:27,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 12:44:27 BoogieIcfgContainer [2021-11-21 00:44:27,952 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-21 00:44:27,955 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-21 00:44:27,955 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-21 00:44:27,956 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-21 00:44:27,956 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:44:27" (3/4) ... [2021-11-21 00:44:27,960 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-11-21 00:44:27,960 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-21 00:44:27,962 INFO L158 Benchmark]: Toolchain (without parser) took 1252.63ms. Allocated memory is still 111.1MB. Free memory was 72.2MB in the beginning and 46.4MB in the end (delta: 25.8MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2021-11-21 00:44:27,963 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 111.1MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:44:27,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.97ms. Allocated memory is still 111.1MB. Free memory was 71.9MB in the beginning and 85.3MB in the end (delta: -13.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-21 00:44:27,966 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.42ms. Allocated memory is still 111.1MB. Free memory was 85.3MB in the beginning and 84.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 00:44:27,967 INFO L158 Benchmark]: Boogie Preprocessor took 20.76ms. Allocated memory is still 111.1MB. Free memory was 84.1MB in the beginning and 82.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:44:27,967 INFO L158 Benchmark]: RCFGBuilder took 271.09ms. Allocated memory is still 111.1MB. Free memory was 82.9MB in the beginning and 73.6MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-21 00:44:27,968 INFO L158 Benchmark]: TraceAbstraction took 655.00ms. Allocated memory is still 111.1MB. Free memory was 73.2MB in the beginning and 46.9MB in the end (delta: 26.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2021-11-21 00:44:27,968 INFO L158 Benchmark]: Witness Printer took 5.42ms. Allocated memory is still 111.1MB. Free memory was 46.9MB in the beginning and 46.4MB in the end (delta: 436.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:44:27,971 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.24ms. Allocated memory is still 111.1MB. Free memory is still 88.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.97ms. Allocated memory is still 111.1MB. Free memory was 71.9MB in the beginning and 85.3MB in the end (delta: -13.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.42ms. Allocated memory is still 111.1MB. Free memory was 85.3MB in the beginning and 84.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.76ms. Allocated memory is still 111.1MB. Free memory was 84.1MB in the beginning and 82.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 271.09ms. Allocated memory is still 111.1MB. Free memory was 82.9MB in the beginning and 73.6MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 655.00ms. Allocated memory is still 111.1MB. Free memory was 73.2MB in the beginning and 46.9MB in the end (delta: 26.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Witness Printer took 5.42ms. Allocated memory is still 111.1MB. Free memory was 46.9MB in the beginning and 46.4MB in the end (delta: 436.9kB). 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++<100 [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.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s 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:44:28,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/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_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/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_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound100.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/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_01164b4f-6960-41d8-a32c-f34920b2d79f/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 f78eb3bd6243e56025d38ea44716c81630a57505e69e1c5e81a8ab68f6ac9a28 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-53f42b1 [2021-11-21 00:44:30,740 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-21 00:44:30,743 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-21 00:44:30,778 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-21 00:44:30,779 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-21 00:44:30,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-21 00:44:30,782 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-21 00:44:30,784 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-21 00:44:30,786 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-21 00:44:30,788 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-21 00:44:30,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-21 00:44:30,790 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-21 00:44:30,791 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-21 00:44:30,792 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-21 00:44:30,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-21 00:44:30,796 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-21 00:44:30,797 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-21 00:44:30,798 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-21 00:44:30,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-21 00:44:30,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-21 00:44:30,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-21 00:44:30,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-21 00:44:30,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-21 00:44:30,809 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-21 00:44:30,813 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-21 00:44:30,813 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-21 00:44:30,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-21 00:44:30,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-21 00:44:30,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-21 00:44:30,817 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-21 00:44:30,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-21 00:44:30,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-21 00:44:30,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-21 00:44:30,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-21 00:44:30,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-21 00:44:30,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-21 00:44:30,823 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-21 00:44:30,823 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-21 00:44:30,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-21 00:44:30,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-21 00:44:30,825 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-21 00:44:30,826 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-11-21 00:44:30,853 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-21 00:44:30,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-21 00:44:30,856 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-21 00:44:30,856 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-21 00:44:30,857 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-21 00:44:30,858 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-21 00:44:30,858 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-21 00:44:30,859 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-21 00:44:30,859 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-21 00:44:30,859 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-21 00:44:30,860 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-21 00:44:30,860 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-21 00:44:30,861 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-21 00:44:30,862 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-21 00:44:30,863 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-21 00:44:30,863 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-21 00:44:30,863 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-21 00:44:30,863 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-21 00:44:30,864 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-21 00:44:30,864 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-11-21 00:44:30,864 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-11-21 00:44:30,864 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-21 00:44:30,864 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-21 00:44:30,865 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-21 00:44:30,865 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-21 00:44:30,865 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-21 00:44:30,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-21 00:44:30,866 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-21 00:44:30,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:44:30,866 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-21 00:44:30,866 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-21 00:44:30,867 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-21 00:44:30,867 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-11-21 00:44:30,867 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-11-21 00:44:30,867 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-21 00:44:30,868 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-21 00:44:30,868 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-21 00:44:30,868 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_01164b4f-6960-41d8-a32c-f34920b2d79f/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_01164b4f-6960-41d8-a32c-f34920b2d79f/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 -> f78eb3bd6243e56025d38ea44716c81630a57505e69e1c5e81a8ab68f6ac9a28 [2021-11-21 00:44:31,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-21 00:44:31,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-21 00:44:31,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-21 00:44:31,369 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-21 00:44:31,370 INFO L275 PluginConnector]: CDTParser initialized [2021-11-21 00:44:31,372 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound100.c [2021-11-21 00:44:31,438 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/data/1a57100fb/dfe292988a4f4a618b337908c24882d6/FLAGb01591581 [2021-11-21 00:44:31,960 INFO L306 CDTParser]: Found 1 translation units. [2021-11-21 00:44:31,961 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound100.c [2021-11-21 00:44:31,971 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/data/1a57100fb/dfe292988a4f4a618b337908c24882d6/FLAGb01591581 [2021-11-21 00:44:32,315 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/data/1a57100fb/dfe292988a4f4a618b337908c24882d6 [2021-11-21 00:44:32,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-21 00:44:32,320 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-21 00:44:32,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-21 00:44:32,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-21 00:44:32,326 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-21 00:44:32,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:44:32" (1/1) ... [2021-11-21 00:44:32,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bc6d2e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:32, skipping insertion in model container [2021-11-21 00:44:32,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:44:32" (1/1) ... [2021-11-21 00:44:32,338 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-21 00:44:32,354 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-21 00:44:32,545 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_01164b4f-6960-41d8-a32c-f34920b2d79f/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound100.c[712,725] [2021-11-21 00:44:32,578 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:44:32,596 INFO L203 MainTranslator]: Completed pre-run [2021-11-21 00:44:32,648 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_01164b4f-6960-41d8-a32c-f34920b2d79f/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound100.c[712,725] [2021-11-21 00:44:32,660 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-21 00:44:32,684 INFO L208 MainTranslator]: Completed translation [2021-11-21 00:44:32,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:32 WrapperNode [2021-11-21 00:44:32,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-21 00:44:32,687 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-21 00:44:32,687 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-21 00:44:32,687 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-21 00:44:32,695 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:44:32" (1/1) ... [2021-11-21 00:44:32,721 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:44:32" (1/1) ... [2021-11-21 00:44:32,747 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 35 [2021-11-21 00:44:32,747 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-21 00:44:32,748 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-21 00:44:32,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-21 00:44:32,749 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-21 00:44:32,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:32" (1/1) ... [2021-11-21 00:44:32,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:32" (1/1) ... [2021-11-21 00:44:32,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:32" (1/1) ... [2021-11-21 00:44:32,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:32" (1/1) ... [2021-11-21 00:44:32,788 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:32" (1/1) ... [2021-11-21 00:44:32,798 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:32" (1/1) ... [2021-11-21 00:44:32,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:32" (1/1) ... [2021-11-21 00:44:32,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-21 00:44:32,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-21 00:44:32,810 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-21 00:44:32,811 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-21 00:44:32,812 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:32" (1/1) ... [2021-11-21 00:44:32,824 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-21 00:44:32,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:44:32,855 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-21 00:44:32,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-21 00:44:32,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-21 00:44:32,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-11-21 00:44:32,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-21 00:44:32,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-21 00:44:32,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-11-21 00:44:32,915 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-11-21 00:44:33,013 INFO L236 CfgBuilder]: Building ICFG [2021-11-21 00:44:33,016 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-21 00:44:34,288 INFO L277 CfgBuilder]: Performing block encoding [2021-11-21 00:44:34,297 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-21 00:44:34,297 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-11-21 00:44:34,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:44:34 BoogieIcfgContainer [2021-11-21 00:44:34,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-21 00:44:34,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-21 00:44:34,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-21 00:44:34,308 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-21 00:44:34,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:44:32" (1/3) ... [2021-11-21 00:44:34,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e7709d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:44:34, skipping insertion in model container [2021-11-21 00:44:34,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:44:32" (2/3) ... [2021-11-21 00:44:34,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e7709d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:44:34, skipping insertion in model container [2021-11-21 00:44:34,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:44:34" (3/3) ... [2021-11-21 00:44:34,313 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_unwindbound100.c [2021-11-21 00:44:34,327 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-21 00:44:34,327 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-21 00:44:34,413 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-21 00:44:34,429 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:44:34,429 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-21 00:44:34,484 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:44:34,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-11-21 00:44:34,491 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:44:34,492 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:44:34,492 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:44:34,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:44:34,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1819757606, now seen corresponding path program 1 times [2021-11-21 00:44:34,535 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:44:34,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339080027] [2021-11-21 00:44:34,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:44:34,538 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:44:34,539 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:44:34,543 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:44:34,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-11-21 00:44:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:44:35,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2021-11-21 00:44:35,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:44:35,437 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:44:35,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:44:35,468 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:44:35,469 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:44:35,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [339080027] [2021-11-21 00:44:35,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [339080027] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:44:35,471 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:44:35,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-11-21 00:44:35,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687626927] [2021-11-21 00:44:35,475 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:44:35,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-21 00:44:35,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:44:35,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-21 00:44:35,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-21 00:44:35,514 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:44:35,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:44:35,536 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2021-11-21 00:44:35,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-21 00:44:35,543 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:44:35,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:44:35,553 INFO L225 Difference]: With dead ends: 32 [2021-11-21 00:44:35,553 INFO L226 Difference]: Without dead ends: 13 [2021-11-21 00:44:35,557 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:44:35,562 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:44:35,564 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:44:35,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-11-21 00:44:35,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-11-21 00:44:35,605 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:44:35,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-11-21 00:44:35,608 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2021-11-21 00:44:35,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:44:35,609 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-11-21 00:44:35,609 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:44:35,610 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2021-11-21 00:44:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-21 00:44:35,611 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:44:35,611 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:44:35,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-11-21 00:44:35,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:44:35,826 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:44:35,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:44:35,827 INFO L85 PathProgramCache]: Analyzing trace with hash 178410715, now seen corresponding path program 1 times [2021-11-21 00:44:35,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:44:35,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567285159] [2021-11-21 00:44:35,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:44:35,829 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:44:35,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:44:35,831 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:44:35,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-11-21 00:44:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:44:36,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-21 00:44:36,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:44:36,393 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:44:36,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:44:36,467 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:44:36,467 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:44:36,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567285159] [2021-11-21 00:44:36,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567285159] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:44:36,468 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:44:36,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-11-21 00:44:36,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094900545] [2021-11-21 00:44:36,469 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:44:36,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-21 00:44:36,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:44:36,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-21 00:44:36,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-21 00:44:36,473 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:44:39,406 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 00:44:41,716 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 00:44:43,880 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 00:44:43,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:44:43,959 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2021-11-21 00:44:43,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-21 00:44:43,960 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:44:43,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:44:43,961 INFO L225 Difference]: With dead ends: 33 [2021-11-21 00:44:43,961 INFO L226 Difference]: Without dead ends: 26 [2021-11-21 00:44:43,962 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:44:43,963 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s 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.5s IncrementalHoareTripleChecker+Time [2021-11-21 00:44:43,964 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.5s Time] [2021-11-21 00:44:43,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-21 00:44:43,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2021-11-21 00:44:43,971 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:44:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2021-11-21 00:44:43,972 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 8 [2021-11-21 00:44:43,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:44:43,973 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2021-11-21 00:44:43,973 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:44:43,974 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2021-11-21 00:44:43,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-21 00:44:43,974 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:44:43,974 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:44:43,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-11-21 00:44:44,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:44:44,186 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:44:44,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:44:44,186 INFO L85 PathProgramCache]: Analyzing trace with hash 180198175, now seen corresponding path program 1 times [2021-11-21 00:44:44,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:44:44,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122208451] [2021-11-21 00:44:44,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:44:44,188 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:44:44,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:44:44,189 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:44:44,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-11-21 00:44:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:44:46,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-21 00:44:46,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:45:11,858 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))) (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse1)) (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))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|))) is different from false [2021-11-21 00:45:18,865 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:45:27,067 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:45:29,107 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:45:29,108 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:45:29,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:45:35,652 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:45:37,710 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:45:52,096 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:45:54,145 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:45:54,146 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:45:54,146 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:45:54,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122208451] [2021-11-21 00:45:54,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1122208451] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-21 00:45:54,147 INFO L186 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2021-11-21 00:45:54,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 10 [2021-11-21 00:45:54,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881645305] [2021-11-21 00:45:54,148 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2021-11-21 00:45:54,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-11-21 00:45:54,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:45:54,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-11-21 00:45:54,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=8, NotChecked=60, Total=110 [2021-11-21 00:45:54,150 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:45:56,269 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:45:58,314 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:46:00,366 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:46:02,418 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:46:34,044 WARN L227 SmtUtils]: Spent 23.80s on a formula simplification. DAG size of input: 28 DAG size of output: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-21 00:46:42,817 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 00:46:45,046 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 00:46:45,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:46:45,113 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2021-11-21 00:46:45,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-21 00:46:45,114 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:46:45,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:46:45,115 INFO L225 Difference]: With dead ends: 28 [2021-11-21 00:46:45,116 INFO L226 Difference]: Without dead ends: 26 [2021-11-21 00:46:45,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 66.7s TimeCoverageRelationStatistics Valid=30, Invalid=38, Unknown=16, NotChecked=126, Total=210 [2021-11-21 00:46:45,120 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2021-11-21 00:46:45,120 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 50 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 2 Unknown, 41 Unchecked, 4.8s Time] [2021-11-21 00:46:45,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-11-21 00:46:45,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-11-21 00:46:45,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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:46:45,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2021-11-21 00:46:45,126 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 8 [2021-11-21 00:46:45,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:46:45,127 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2021-11-21 00:46:45,127 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:46:45,127 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2021-11-21 00:46:45,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-21 00:46:45,128 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:46:45,128 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:46:45,150 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-11-21 00:46:45,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:46:45,332 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:46:45,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:46:45,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1780785341, now seen corresponding path program 1 times [2021-11-21 00:46:45,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:46:45,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159442943] [2021-11-21 00:46:45,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:46:45,335 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:46:45,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:46:45,344 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:46:45,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-11-21 00:46:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:46:45,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-21 00:46:45,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:46:52,029 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:46:54,089 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:47:06,523 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:47:14,830 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:47:14,849 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:47:14,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:47:39,914 WARN L227 SmtUtils]: Spent 16.67s 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:47:56,612 WARN L227 SmtUtils]: Spent 16.70s 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:48:04,977 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:48:19,525 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:48:19,544 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:48:19,545 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-11-21 00:48:19,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159442943] [2021-11-21 00:48:19,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159442943] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:48:19,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1271260688] [2021-11-21 00:48:19,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:48:19,546 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-11-21 00:48:19,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/cvc4 [2021-11-21 00:48:19,553 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-11-21 00:48:19,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2021-11-21 00:48:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:48:19,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-21 00:48:19,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:48:36,278 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:48:44,589 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:48:44,602 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:48:44,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:49:09,629 WARN L227 SmtUtils]: Spent 16.69s 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:49:26,446 WARN L227 SmtUtils]: Spent 16.82s 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:49:34,746 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:49:49,256 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:49:49,268 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:49:49,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1271260688] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:49:49,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683724906] [2021-11-21 00:49:49,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:49:49,270 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-21 00:49:49,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/z3 [2021-11-21 00:49:49,278 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-21 00:49:49,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-21 00:49:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-21 00:49:49,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-21 00:49:49,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-21 00:50:06,167 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:50:14,465 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:50:14,477 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:14,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-21 00:50:39,288 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:50:55,780 WARN L227 SmtUtils]: Spent 16.49s 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:51:04,143 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:51:18,637 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:51:18,657 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:18,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683724906] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-21 00:51:18,658 INFO L186 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2021-11-21 00:51:18,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7, 7] total 18 [2021-11-21 00:51:18,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208119896] [2021-11-21 00:51:18,658 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2021-11-21 00:51:18,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-21 00:51:18,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-11-21 00:51:18,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-21 00:51:18,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=25, Unknown=14, NotChecked=234, Total=306 [2021-11-21 00:51:18,660 INFO L87 Difference]: Start difference. First operand 26 states and 30 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:51:20,787 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 00:51:22,793 WARN L515 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-11-21 00:51:25,036 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:51:27,207 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:51:29,377 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:51:31,565 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:51:33,736 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:51:33,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-21 00:51:33,739 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2021-11-21 00:51:33,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-21 00:51:33,740 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:51:33,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-21 00:51:33,741 INFO L225 Difference]: With dead ends: 31 [2021-11-21 00:51:33,742 INFO L226 Difference]: Without dead ends: 23 [2021-11-21 00:51:33,742 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:51:33,744 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-11-21 00:51:33,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 2 Unknown, 89 Unchecked, 4.2s Time] [2021-11-21 00:51:33,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-11-21 00:51:33,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-11-21 00:51:33,750 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:51:33,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2021-11-21 00:51:33,752 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 14 [2021-11-21 00:51:33,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-21 00:51:33,752 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2021-11-21 00:51:33,752 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:51:33,753 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2021-11-21 00:51:33,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-21 00:51:33,754 INFO L506 BasicCegarLoop]: Found error trace [2021-11-21 00:51:33,754 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-21 00:51:33,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-21 00:51:33,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2021-11-21 00:51:34,171 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-11-21 00:51:34,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/cvc4 --incremental --print-success --lang smt,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:51:34,355 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-21 00:51:34,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-21 00:51:34,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1540611354, now seen corresponding path program 1 times [2021-11-21 00:51:34,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-11-21 00:51:34,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633495433] [2021-11-21 00:51:34,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-21 00:51:34,357 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-11-21 00:51:34,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/mathsat [2021-11-21 00:51:34,358 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-11-21 00:51:34,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-11-21 00:51:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-21 00:51:40,450 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-21 00:51:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-21 00:51:52,547 INFO L133 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2021-11-21 00:51:52,548 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-21 00:51:52,549 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-21 00:51:52,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-11-21 00:51:52,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/mathsat -unsat_core_generation=3 [2021-11-21 00:51:52,755 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2021-11-21 00:51:52,759 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-21 00:51:52,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 12:51:52 BoogieIcfgContainer [2021-11-21 00:51:52,788 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-21 00:51:52,789 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-21 00:51:52,789 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-21 00:51:52,789 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-21 00:51:52,793 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:44:34" (3/4) ... [2021-11-21 00:51:52,795 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-21 00:51:52,870 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/witness.graphml [2021-11-21 00:51:52,870 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-21 00:51:52,872 INFO L158 Benchmark]: Toolchain (without parser) took 440552.11ms. Allocated memory was 62.9MB in the beginning and 94.4MB in the end (delta: 31.5MB). Free memory was 43.6MB in the beginning and 68.6MB in the end (delta: -25.0MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2021-11-21 00:51:52,872 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 62.9MB. Free memory was 44.8MB in the beginning and 44.8MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:51:52,873 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.02ms. Allocated memory is still 62.9MB. Free memory was 43.4MB in the beginning and 46.3MB in the end (delta: -2.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-21 00:51:52,874 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.79ms. Allocated memory is still 62.9MB. Free memory was 46.3MB in the beginning and 44.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:51:52,874 INFO L158 Benchmark]: Boogie Preprocessor took 59.28ms. Allocated memory is still 62.9MB. Free memory was 44.7MB in the beginning and 43.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 00:51:52,875 INFO L158 Benchmark]: RCFGBuilder took 1490.93ms. Allocated memory is still 62.9MB. Free memory was 43.4MB in the beginning and 34.8MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-11-21 00:51:52,875 INFO L158 Benchmark]: TraceAbstraction took 438484.41ms. Allocated memory was 62.9MB in the beginning and 94.4MB in the end (delta: 31.5MB). Free memory was 34.3MB in the beginning and 70.7MB in the end (delta: -36.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-21 00:51:52,876 INFO L158 Benchmark]: Witness Printer took 82.20ms. Allocated memory is still 94.4MB. Free memory was 70.7MB in the beginning and 68.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-21 00:51:52,880 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.30ms. Allocated memory is still 62.9MB. Free memory was 44.8MB in the beginning and 44.8MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.02ms. Allocated memory is still 62.9MB. Free memory was 43.4MB in the beginning and 46.3MB in the end (delta: -2.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.79ms. Allocated memory is still 62.9MB. Free memory was 46.3MB in the beginning and 44.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.28ms. Allocated memory is still 62.9MB. Free memory was 44.7MB in the beginning and 43.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1490.93ms. Allocated memory is still 62.9MB. Free memory was 43.4MB in the beginning and 34.8MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 438484.41ms. Allocated memory was 62.9MB in the beginning and 94.4MB in the end (delta: 31.5MB). Free memory was 34.3MB in the beginning and 70.7MB in the end (delta: -36.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 82.20ms. Allocated memory is still 94.4MB. Free memory was 70.7MB in the beginning and 68.6MB in the end (delta: 2.1MB). 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++<100 [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++<100 [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: 438.3s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 73.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 16.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 180 SdHoareTripleChecker+Invalid, 16.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 130 IncrementalHoareTripleChecker+Unchecked, 129 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 51 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 24 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 106.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=3, InterpolantAutomatonStates: 22, 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.1s SsaConstructionTime, 10.3s SatisfiabilityAnalysisTime, 340.3s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 118 ConstructedInterpolants, 19 QuantifiedInterpolants, 1196 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:51:53,133 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-21 00:51:53,162 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_01164b4f-6960-41d8-a32c-f34920b2d79f/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 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