./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter2_set.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_set.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1052e6ec9925823ba5a2ccaaebf89a3336e5de0f5b82a0218158837daebc1dd1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 12:06:48,684 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:06:48,686 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:06:48,699 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:06:48,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:06:48,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:06:48,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:06:48,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:06:48,703 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:06:48,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:06:48,704 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:06:48,705 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:06:48,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:06:48,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:06:48,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:06:48,708 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:06:48,710 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:06:48,711 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:06:48,714 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:06:48,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:06:48,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:06:48,721 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:06:48,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:06:48,724 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:06:48,730 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:06:48,731 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:06:48,731 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:06:48,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:06:48,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:06:48,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:06:48,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:06:48,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:06:48,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:06:48,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:06:48,739 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:06:48,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:06:48,740 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:06:48,741 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:06:48,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:06:48,742 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:06:48,742 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:06:48,743 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 12:06:48,768 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:06:48,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:06:48,768 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:06:48,768 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:06:48,769 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:06:48,769 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:06:48,770 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:06:48,770 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:06:48,770 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:06:48,771 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:06:48,771 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:06:48,771 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:06:48,771 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:06:48,771 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:06:48,772 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:06:48,772 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:06:48,772 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:06:48,772 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:06:48,772 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:06:48,772 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:06:48,773 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:06:48,773 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:06:48,773 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:06:48,773 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:06:48,773 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:06:48,774 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:06:48,774 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:06:48,774 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:06:48,774 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:06:48,774 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:06:48,775 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:06:48,775 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 12:06:48,775 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:06:48,775 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:06:48,775 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:06:48,775 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/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_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1052e6ec9925823ba5a2ccaaebf89a3336e5de0f5b82a0218158837daebc1dd1 [2022-12-13 12:06:48,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:06:48,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:06:48,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:06:48,956 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:06:48,956 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:06:48,957 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/float-benchs/filter2_set.c [2022-12-13 12:06:51,555 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:06:51,695 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:06:51,696 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/sv-benchmarks/c/float-benchs/filter2_set.c [2022-12-13 12:06:51,700 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/data/946607987/b9d39681cfca40cd8ddec37027fc3a8b/FLAG0a6157dcc [2022-12-13 12:06:51,711 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/data/946607987/b9d39681cfca40cd8ddec37027fc3a8b [2022-12-13 12:06:51,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:06:51,714 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:06:51,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:06:51,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:06:51,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:06:51,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:06:51" (1/1) ... [2022-12-13 12:06:51,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@529f90a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:51, skipping insertion in model container [2022-12-13 12:06:51,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:06:51" (1/1) ... [2022-12-13 12:06:51,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:06:51,734 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:06:51,836 WARN L237 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_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/sv-benchmarks/c/float-benchs/filter2_set.c[664,677] [2022-12-13 12:06:51,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:06:51,855 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:06:51,863 WARN L237 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_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/sv-benchmarks/c/float-benchs/filter2_set.c[664,677] [2022-12-13 12:06:51,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:06:51,877 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:06:51,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:51 WrapperNode [2022-12-13 12:06:51,878 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:06:51,879 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:06:51,879 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:06:51,879 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:06:51,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:51" (1/1) ... [2022-12-13 12:06:51,890 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:51" (1/1) ... [2022-12-13 12:06:51,907 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2022-12-13 12:06:51,907 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:06:51,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:06:51,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:06:51,908 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:06:51,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:51" (1/1) ... [2022-12-13 12:06:51,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:51" (1/1) ... [2022-12-13 12:06:51,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:51" (1/1) ... [2022-12-13 12:06:51,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:51" (1/1) ... [2022-12-13 12:06:51,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:51" (1/1) ... [2022-12-13 12:06:51,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:51" (1/1) ... [2022-12-13 12:06:51,923 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:51" (1/1) ... [2022-12-13 12:06:51,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:51" (1/1) ... [2022-12-13 12:06:51,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:06:51,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:06:51,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:06:51,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:06:51,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:51" (1/1) ... [2022-12-13 12:06:51,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:06:51,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:06:51,953 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:06:51,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:06:51,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:06:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 12:06:51,988 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 12:06:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:06:51,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:06:51,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:06:52,049 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:06:52,051 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:06:52,151 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:06:52,155 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:06:52,156 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 12:06:52,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:06:52 BoogieIcfgContainer [2022-12-13 12:06:52,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:06:52,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:06:52,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:06:52,162 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:06:52,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:06:51" (1/3) ... [2022-12-13 12:06:52,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464362f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:06:52, skipping insertion in model container [2022-12-13 12:06:52,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:51" (2/3) ... [2022-12-13 12:06:52,163 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@464362f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:06:52, skipping insertion in model container [2022-12-13 12:06:52,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:06:52" (3/3) ... [2022-12-13 12:06:52,164 INFO L112 eAbstractionObserver]: Analyzing ICFG filter2_set.c [2022-12-13 12:06:52,178 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:06:52,179 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 12:06:52,215 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:06:52,220 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1240889c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 12:06:52,221 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 12:06:52,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 12:06:52,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 12:06:52,231 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:06:52,231 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:52,232 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:06:52,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:52,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1697849372, now seen corresponding path program 1 times [2022-12-13 12:06:52,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:52,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372886371] [2022-12-13 12:06:52,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:52,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:52,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 12:06:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:52,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-12-13 12:06:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:52,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 12:06:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:52,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 12:06:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:52,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-12-13 12:06:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:52,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 12:06:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:52,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 12:06:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:52,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 12:06:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:06:52,400 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-12-13 12:06:52,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:06:52,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372886371] [2022-12-13 12:06:52,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372886371] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:06:52,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:06:52,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:06:52,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355646285] [2022-12-13 12:06:52,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:06:52,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 12:06:52,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:06:52,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 12:06:52,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:06:52,431 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 12:06:52,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:06:52,448 INFO L93 Difference]: Finished difference Result 51 states and 78 transitions. [2022-12-13 12:06:52,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 12:06:52,449 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 48 [2022-12-13 12:06:52,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:06:52,454 INFO L225 Difference]: With dead ends: 51 [2022-12-13 12:06:52,455 INFO L226 Difference]: Without dead ends: 23 [2022-12-13 12:06:52,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:06:52,459 INFO L413 NwaCegarLoop]: 34 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, 34 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 [2022-12-13 12:06:52,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:06:52,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-12-13 12:06:52,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-12-13 12:06:52,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 12:06:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-12-13 12:06:52,488 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 48 [2022-12-13 12:06:52,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:06:52,489 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-12-13 12:06:52,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 12:06:52,489 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-12-13 12:06:52,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 12:06:52,491 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:06:52,491 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:06:52,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:06:52,491 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:06:52,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:06:52,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1417424168, now seen corresponding path program 1 times [2022-12-13 12:06:52,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:06:52,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143477130] [2022-12-13 12:06:52,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:06:52,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:06:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:06:52,527 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:06:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:06:52,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:06:52,581 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:06:52,583 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 12:06:52,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:06:52,587 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2022-12-13 12:06:52,590 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:06:52,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:06:52 BoogieIcfgContainer [2022-12-13 12:06:52,619 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:06:52,619 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 12:06:52,620 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 12:06:52,620 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 12:06:52,620 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:06:52" (3/4) ... [2022-12-13 12:06:52,623 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 12:06:52,623 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 12:06:52,624 INFO L158 Benchmark]: Toolchain (without parser) took 909.80ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 108.4MB in the beginning and 140.9MB in the end (delta: -32.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:06:52,624 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:06:52,625 INFO L158 Benchmark]: CACSL2BoogieTranslator took 163.28ms. Allocated memory is still 142.6MB. Free memory was 107.9MB in the beginning and 97.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 12:06:52,625 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.07ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 95.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:06:52,626 INFO L158 Benchmark]: Boogie Preprocessor took 17.21ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 12:06:52,626 INFO L158 Benchmark]: RCFGBuilder took 231.53ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 84.1MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 12:06:52,627 INFO L158 Benchmark]: TraceAbstraction took 459.88ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 83.3MB in the beginning and 141.9MB in the end (delta: -58.6MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2022-12-13 12:06:52,627 INFO L158 Benchmark]: Witness Printer took 3.82ms. Allocated memory is still 172.0MB. Free memory was 141.9MB in the beginning and 140.9MB in the end (delta: 955.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 12:06:52,630 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.15ms. Allocated memory is still 142.6MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 163.28ms. Allocated memory is still 142.6MB. Free memory was 107.9MB in the beginning and 97.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.07ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 95.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.21ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 94.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 231.53ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 84.1MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 459.88ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 83.3MB in the beginning and 141.9MB in the end (delta: -58.6MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. * Witness Printer took 3.82ms. Allocated memory is still 172.0MB. Free memory was 141.9MB in the beginning and 140.9MB in the end (delta: 955.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 57, overapproximation of to_real at line 43, overapproximation of someBinaryArithmeticDOUBLEoperation at line 55. Possible FailurePath: [L22] double E, E0, E1, S0, S1, S; [L23] double A1, A2, A3, B1, B2; [L24] int i; [L26] A1 = __VERIFIER_nondet_double() [L27] A2 = __VERIFIER_nondet_double() [L28] A3 = __VERIFIER_nondet_double() [L29] B1 = __VERIFIER_nondet_double() [L30] B2 = __VERIFIER_nondet_double() [L31] CALL assume_abort_if_not(A1 >= 0.69 && A1 <= 0.71) VAL [\old(cond)=1] [L15] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L31] RET assume_abort_if_not(A1 >= 0.69 && A1 <= 0.71) [L32] CALL assume_abort_if_not(A2 >= -1.31 && A2 <= -1.29) VAL [\old(cond)=1] [L15] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L32] RET assume_abort_if_not(A2 >= -1.31 && A2 <= -1.29) [L33] CALL assume_abort_if_not(A3 >= 1.09 && A3 <= 1.11) VAL [\old(cond)=1] [L15] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L33] RET assume_abort_if_not(A3 >= 1.09 && A3 <= 1.11) [L34] CALL assume_abort_if_not(B1 >= 1.39 && B1 <= 1.41) VAL [\old(cond)=1] [L15] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L34] RET assume_abort_if_not(B1 >= 1.39 && B1 <= 1.41) [L35] CALL assume_abort_if_not(B2 >= -0.71 && B2 <= -0.69) VAL [\old(cond)=1] [L15] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L35] RET assume_abort_if_not(B2 >= -0.71 && B2 <= -0.69) [L38] E = __VERIFIER_nondet_double() [L39] E0 = __VERIFIER_nondet_double() [L40] CALL assume_abort_if_not(E >= 0. && E <= 1.) VAL [\old(cond)=1] [L15] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L40] RET assume_abort_if_not(E >= 0. && E <= 1.) VAL [E=55, E=56] [L41] CALL assume_abort_if_not(E0 >= 0. && E0 <= 1.) VAL [\old(cond)=1] [L15] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L41] RET assume_abort_if_not(E0 >= 0. && E0 <= 1.) VAL [E=56, E=55] [L43] S0 = 0 [L44] S = 0 [L46] i = 0 VAL [E=56, E=55, i=0] [L46] COND TRUE i <= 1000000 [L47] E1 = E0 [L48] E0 = E [L50] E = __VERIFIER_nondet_double() [L51] CALL assume_abort_if_not(E >= 0. && E <= 1.) VAL [\old(cond)=1] [L15] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L51] RET assume_abort_if_not(E >= 0. && E <= 1.) VAL [E=53, E=56, E=55, i=0] [L53] S1 = S0 [L54] S0 = S [L55] S = A1*E - E0*A2 + E1*A3 + S0*B1 + S1*B2 [L57] CALL __VERIFIER_assert(S >= -100. && S <= 100.) [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L17] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 34 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 47 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 112/112 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 [2022-12-13 12:06:52,645 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/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/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_set.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1052e6ec9925823ba5a2ccaaebf89a3336e5de0f5b82a0218158837daebc1dd1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 12:06:54,437 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:06:54,438 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:06:54,452 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:06:54,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:06:54,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:06:54,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:06:54,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:06:54,456 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:06:54,457 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:06:54,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:06:54,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:06:54,458 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:06:54,459 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:06:54,460 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:06:54,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:06:54,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:06:54,462 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:06:54,463 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:06:54,464 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:06:54,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:06:54,466 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:06:54,467 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:06:54,468 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:06:54,470 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:06:54,470 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:06:54,471 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:06:54,471 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:06:54,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:06:54,472 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:06:54,472 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:06:54,473 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:06:54,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:06:54,474 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:06:54,474 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:06:54,475 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:06:54,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:06:54,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:06:54,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:06:54,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:06:54,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:06:54,477 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-12-13 12:06:54,492 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:06:54,493 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:06:54,493 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:06:54,493 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:06:54,494 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:06:54,494 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:06:54,494 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:06:54,494 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:06:54,494 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:06:54,494 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:06:54,494 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:06:54,495 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:06:54,495 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:06:54,495 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:06:54,495 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:06:54,495 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:06:54,495 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 12:06:54,495 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 12:06:54,495 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 12:06:54,495 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:06:54,495 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:06:54,495 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:06:54,496 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:06:54,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:06:54,496 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:06:54,496 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:06:54,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:06:54,496 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:06:54,496 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:06:54,496 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:06:54,496 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 12:06:54,496 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 12:06:54,497 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:06:54,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 12:06:54,497 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:06:54,497 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:06:54,497 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 12:06:54,497 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:06:54,497 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/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_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1052e6ec9925823ba5a2ccaaebf89a3336e5de0f5b82a0218158837daebc1dd1 [2022-12-13 12:06:54,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:06:54,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:06:54,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:06:54,755 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:06:54,756 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:06:54,757 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/float-benchs/filter2_set.c [2022-12-13 12:06:57,223 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:06:57,382 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:06:57,383 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/sv-benchmarks/c/float-benchs/filter2_set.c [2022-12-13 12:06:57,388 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/data/698355e81/5f0cd94b35d74f9298360414a03a61f3/FLAG62b0fba91 [2022-12-13 12:06:57,781 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/data/698355e81/5f0cd94b35d74f9298360414a03a61f3 [2022-12-13 12:06:57,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:06:57,784 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:06:57,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:06:57,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:06:57,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:06:57,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:06:57" (1/1) ... [2022-12-13 12:06:57,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d60dbb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:57, skipping insertion in model container [2022-12-13 12:06:57,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:06:57" (1/1) ... [2022-12-13 12:06:57,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:06:57,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:06:57,918 WARN L237 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_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/sv-benchmarks/c/float-benchs/filter2_set.c[664,677] [2022-12-13 12:06:57,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:06:57,946 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:06:57,958 WARN L237 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_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/sv-benchmarks/c/float-benchs/filter2_set.c[664,677] [2022-12-13 12:06:57,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:06:57,977 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:06:57,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:57 WrapperNode [2022-12-13 12:06:57,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:06:57,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:06:57,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:06:57,979 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:06:57,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:57" (1/1) ... [2022-12-13 12:06:57,991 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:57" (1/1) ... [2022-12-13 12:06:58,005 INFO L138 Inliner]: procedures = 15, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2022-12-13 12:06:58,005 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:06:58,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:06:58,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:06:58,006 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:06:58,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:57" (1/1) ... [2022-12-13 12:06:58,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:57" (1/1) ... [2022-12-13 12:06:58,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:57" (1/1) ... [2022-12-13 12:06:58,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:57" (1/1) ... [2022-12-13 12:06:58,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:57" (1/1) ... [2022-12-13 12:06:58,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:57" (1/1) ... [2022-12-13 12:06:58,024 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:57" (1/1) ... [2022-12-13 12:06:58,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:57" (1/1) ... [2022-12-13 12:06:58,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:06:58,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:06:58,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:06:58,029 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:06:58,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:57" (1/1) ... [2022-12-13 12:06:58,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:06:58,047 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:06:58,058 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:06:58,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:06:58,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:06:58,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 12:06:58,094 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-13 12:06:58,094 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-13 12:06:58,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:06:58,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:06:58,159 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:06:58,161 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:07:00,535 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:07:00,540 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:07:00,540 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 12:07:00,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:07:00 BoogieIcfgContainer [2022-12-13 12:07:00,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:07:00,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:07:00,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:07:00,547 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:07:00,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:06:57" (1/3) ... [2022-12-13 12:07:00,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18dcbf72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:07:00, skipping insertion in model container [2022-12-13 12:07:00,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:57" (2/3) ... [2022-12-13 12:07:00,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18dcbf72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:07:00, skipping insertion in model container [2022-12-13 12:07:00,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:07:00" (3/3) ... [2022-12-13 12:07:00,549 INFO L112 eAbstractionObserver]: Analyzing ICFG filter2_set.c [2022-12-13 12:07:00,562 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:07:00,562 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 12:07:00,594 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:07:00,599 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@37649a00, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 12:07:00,599 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 12:07:00,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 12:07:00,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 12:07:00,608 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:07:00,608 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:00,608 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:07:00,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:00,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1697849372, now seen corresponding path program 1 times [2022-12-13 12:07:00,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:07:00,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477923895] [2022-12-13 12:07:00,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:00,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:07:00,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:07:00,622 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:07:00,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-13 12:07:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:01,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 12:07:01,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:07:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-12-13 12:07:01,895 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:07:01,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:07:01,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477923895] [2022-12-13 12:07:01,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [477923895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:01,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:01,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:07:01,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948951788] [2022-12-13 12:07:01,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:01,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 12:07:01,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:07:01,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 12:07:01,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:07:01,924 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 12:07:01,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:07:01,938 INFO L93 Difference]: Finished difference Result 51 states and 78 transitions. [2022-12-13 12:07:01,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 12:07:01,940 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 48 [2022-12-13 12:07:01,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:07:01,945 INFO L225 Difference]: With dead ends: 51 [2022-12-13 12:07:01,945 INFO L226 Difference]: Without dead ends: 23 [2022-12-13 12:07:01,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:07:01,949 INFO L413 NwaCegarLoop]: 34 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, 34 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 [2022-12-13 12:07:01,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:07:01,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-12-13 12:07:01,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-12-13 12:07:01,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 12:07:01,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-12-13 12:07:01,975 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 48 [2022-12-13 12:07:01,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:07:01,975 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-12-13 12:07:01,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 12:07:01,975 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-12-13 12:07:01,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 12:07:01,977 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:07:01,977 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:07:02,012 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-13 12:07:02,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:07:02,179 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:07:02,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:02,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1417424168, now seen corresponding path program 1 times [2022-12-13 12:07:02,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:07:02,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971034665] [2022-12-13 12:07:02,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:02,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:07:02,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:07:02,188 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:07:02,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-13 12:07:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:08,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 12:07:08,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:17:03,710 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (let ((.cse1 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (.cse5 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (.cse3 (fp.neg .cse0)) (.cse6 (fp.neg .cse7)) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse11 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (.cse12 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0)))) (or (and (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~B2~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~A1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~A2~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~B1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~A3~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A1~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~A2~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.geq |ULTIMATE.start_main_~B2~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~B1~0#1| .cse4) (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.geq |ULTIMATE.start_main_~A2~0#1| .cse5) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~B2~0#1| .cse6) (fp.geq |ULTIMATE.start_main_~A1~0#1| .cse7) (fp.leq |ULTIMATE.start_main_~B1~0#1| .cse8) (fp.geq |ULTIMATE.start_main_~A3~0#1| .cse9) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse2) (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~A1~0#1| |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| |ULTIMATE.start_main_~A2~0#1|)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| |ULTIMATE.start_main_~A3~0#1|)) (fp.mul roundNearestTiesToEven .cse10 |ULTIMATE.start_main_~B1~0#1|)) (fp.mul roundNearestTiesToEven .cse10 |ULTIMATE.start_main_~B2~0#1|)) .cse11) (fp.leq |ULTIMATE.start_main_~A3~0#1| .cse12))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (or (exists ((|ULTIMATE.start_main_~A3~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~A3~0#1| .cse9) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse2) (exists ((|ULTIMATE.start_main_~B1~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~B1~0#1| .cse4) (exists ((|ULTIMATE.start_main_~A2~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A2~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~A2~0#1| .cse5) (exists ((|ULTIMATE.start_main_~A1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A1~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~B2~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~A1~0#1| |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| |ULTIMATE.start_main_~A2~0#1|)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| |ULTIMATE.start_main_~A3~0#1|)) (fp.mul roundNearestTiesToEven .cse10 |ULTIMATE.start_main_~B1~0#1|)) (fp.mul roundNearestTiesToEven .cse10 |ULTIMATE.start_main_~B2~0#1|)) (fp.neg .cse11))) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse2))) (fp.geq |ULTIMATE.start_main_~B2~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~B2~0#1| .cse6))) (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse2))) (fp.geq |ULTIMATE.start_main_~A1~0#1| .cse7))))) (fp.leq |ULTIMATE.start_main_~B1~0#1| .cse8))))) (fp.leq |ULTIMATE.start_main_~A3~0#1| .cse12))) (exists ((|ULTIMATE.start_main_~A3~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~B1~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~A2~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A2~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~A2~0#1| .cse5) (exists ((|ULTIMATE.start_main_~A1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A1~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~B2~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~B2~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~B2~0#1| .cse6) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse2) (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~A1~0#1| |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| |ULTIMATE.start_main_~A2~0#1|)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| |ULTIMATE.start_main_~A3~0#1|)) (fp.mul roundNearestTiesToEven .cse10 |ULTIMATE.start_main_~B1~0#1|)) (fp.mul roundNearestTiesToEven .cse10 |ULTIMATE.start_main_~B2~0#1|)) .cse11)))))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse2))) (fp.geq |ULTIMATE.start_main_~A1~0#1| .cse7))))) (fp.geq |ULTIMATE.start_main_~B1~0#1| .cse4) (fp.leq |ULTIMATE.start_main_~B1~0#1| .cse8))) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse2))) (fp.geq |ULTIMATE.start_main_~A3~0#1| .cse9) (fp.leq |ULTIMATE.start_main_~A3~0#1| .cse12)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))))) is different from false [2022-12-13 12:17:38,149 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (let ((.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (.cse8 (fp.neg .cse5)) (.cse9 (fp.neg .cse10)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (.cse11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (.cse12 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0)))) (or (exists ((|ULTIMATE.start_main_~A3~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~A3~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse1) (exists ((|ULTIMATE.start_main_~B1~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~B1~0#1| .cse2) (exists ((|ULTIMATE.start_main_~A2~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A2~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~A2~0#1| .cse4) (exists ((|ULTIMATE.start_main_~A1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A1~0#1| .cse5) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~B2~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~A1~0#1| |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| |ULTIMATE.start_main_~A2~0#1|)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| |ULTIMATE.start_main_~A3~0#1|)) (fp.mul roundNearestTiesToEven .cse6 |ULTIMATE.start_main_~B1~0#1|)) (fp.mul roundNearestTiesToEven .cse6 |ULTIMATE.start_main_~B2~0#1|)) (fp.neg .cse7))) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse1))) (fp.geq |ULTIMATE.start_main_~B2~0#1| .cse8) (fp.leq |ULTIMATE.start_main_~B2~0#1| .cse9))) (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse1))) (fp.geq |ULTIMATE.start_main_~A1~0#1| .cse10))))) (fp.leq |ULTIMATE.start_main_~B1~0#1| .cse11))))) (fp.leq |ULTIMATE.start_main_~A3~0#1| .cse12))) (exists ((|ULTIMATE.start_main_~A3~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~B1~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~A2~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A2~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~A2~0#1| .cse4) (exists ((|ULTIMATE.start_main_~A1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A1~0#1| .cse5) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~B2~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~B2~0#1| .cse8) (fp.leq |ULTIMATE.start_main_~B2~0#1| .cse9) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse1) (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~A1~0#1| |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| |ULTIMATE.start_main_~A2~0#1|)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| |ULTIMATE.start_main_~A3~0#1|)) (fp.mul roundNearestTiesToEven .cse6 |ULTIMATE.start_main_~B1~0#1|)) (fp.mul roundNearestTiesToEven .cse6 |ULTIMATE.start_main_~B2~0#1|)) .cse7)))))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse1))) (fp.geq |ULTIMATE.start_main_~A1~0#1| .cse10))))) (fp.geq |ULTIMATE.start_main_~B1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~B1~0#1| .cse11))) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse1))) (fp.geq |ULTIMATE.start_main_~A3~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~A3~0#1| .cse12)))))) is different from false [2022-12-13 12:17:40,244 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (let ((.cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (.cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (.cse8 (fp.neg .cse5)) (.cse9 (fp.neg .cse10)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (.cse11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (.cse12 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0)))) (or (exists ((|ULTIMATE.start_main_~A3~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~A3~0#1| .cse0) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse1) (exists ((|ULTIMATE.start_main_~B1~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~B1~0#1| .cse2) (exists ((|ULTIMATE.start_main_~A2~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A2~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~A2~0#1| .cse4) (exists ((|ULTIMATE.start_main_~A1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A1~0#1| .cse5) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~B2~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~A1~0#1| |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| |ULTIMATE.start_main_~A2~0#1|)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| |ULTIMATE.start_main_~A3~0#1|)) (fp.mul roundNearestTiesToEven .cse6 |ULTIMATE.start_main_~B1~0#1|)) (fp.mul roundNearestTiesToEven .cse6 |ULTIMATE.start_main_~B2~0#1|)) (fp.neg .cse7))) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse1))) (fp.geq |ULTIMATE.start_main_~B2~0#1| .cse8) (fp.leq |ULTIMATE.start_main_~B2~0#1| .cse9))) (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse1))) (fp.geq |ULTIMATE.start_main_~A1~0#1| .cse10))))) (fp.leq |ULTIMATE.start_main_~B1~0#1| .cse11))))) (fp.leq |ULTIMATE.start_main_~A3~0#1| .cse12))) (exists ((|ULTIMATE.start_main_~A3~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~B1~0#1| (_ FloatingPoint 11 53))) (and (exists ((|ULTIMATE.start_main_~A2~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A2~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~A2~0#1| .cse4) (exists ((|ULTIMATE.start_main_~A1~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~A1~0#1| .cse5) (exists ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~B2~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~B2~0#1| .cse8) (fp.leq |ULTIMATE.start_main_~B2~0#1| .cse9) (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse1) (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~A1~0#1| |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| |ULTIMATE.start_main_~A2~0#1|)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| |ULTIMATE.start_main_~A3~0#1|)) (fp.mul roundNearestTiesToEven .cse6 |ULTIMATE.start_main_~B1~0#1|)) (fp.mul roundNearestTiesToEven .cse6 |ULTIMATE.start_main_~B2~0#1|)) .cse7)))))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse1))) (fp.geq |ULTIMATE.start_main_~A1~0#1| .cse10))))) (fp.geq |ULTIMATE.start_main_~B1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~B1~0#1| .cse11))) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse1))) (fp.geq |ULTIMATE.start_main_~A3~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~A3~0#1| .cse12)))))) is different from true [2022-12-13 12:17:40,245 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-12-13 12:17:40,245 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:17:40,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 12:17:40,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971034665] [2022-12-13 12:17:40,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971034665] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:17:40,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:17:40,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-12-13 12:17:40,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660622086] [2022-12-13 12:17:40,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:17:40,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-13 12:17:40,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 12:17:40,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-13 12:17:40,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=130, Unknown=3, NotChecked=54, Total=272 [2022-12-13 12:17:40,251 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 12:17:42,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 12:17:46,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 12:17:46,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:17:46,190 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-12-13 12:17:46,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 12:17:46,404 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 48 [2022-12-13 12:17:46,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:17:46,405 INFO L225 Difference]: With dead ends: 33 [2022-12-13 12:17:46,405 INFO L226 Difference]: Without dead ends: 31 [2022-12-13 12:17:46,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=90, Invalid=155, Unknown=3, NotChecked=58, Total=306 [2022-12-13 12:17:46,407 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-12-13 12:17:46,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 59 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 1 Unknown, 46 Unchecked, 5.7s Time] [2022-12-13 12:17:46,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-12-13 12:17:46,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-12-13 12:17:46,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-12-13 12:17:46,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-12-13 12:17:46,420 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 48 [2022-12-13 12:17:46,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:17:46,420 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-12-13 12:17:46,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-12-13 12:17:46,421 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-12-13 12:17:46,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 12:17:46,422 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:17:46,423 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:17:46,452 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-13 12:17:46,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:17:46,625 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 12:17:46,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:17:46,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1357191508, now seen corresponding path program 1 times [2022-12-13 12:17:46,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 12:17:46,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820220190] [2022-12-13 12:17:46,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:17:46,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 12:17:46,627 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 12:17:46,628 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 12:17:46,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a4757b67-bfd8-4b2e-8a98-7a810327c2cc/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-13 12:20:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:20:40,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 47 conjunts are in the unsatisfiable core [2022-12-13 12:20:40,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:21:16,359 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0)))) (and (fp.geq |c_ULTIMATE.start_main_~A1~0#1| .cse0) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (let ((.cse1 (fp.geq |c_ULTIMATE.start_main_~S~0#1| (fp.neg .cse3))) (.cse2 (fp.leq |c_ULTIMATE.start_main_~S~0#1| .cse3))) (or (and (or (not .cse1) (not .cse2)) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (and .cse1 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse2)))) (= .cse4 |c_ULTIMATE.start_main_~S0~0#1|) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (= |c_ULTIMATE.start_main_~S~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~A1~0#1| |c_ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E0~0#1| |c_ULTIMATE.start_main_~A2~0#1|)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E1~0#1| |c_ULTIMATE.start_main_~A3~0#1|)) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~S0~0#1| |c_ULTIMATE.start_main_~B1~0#1|)) (fp.mul c_currentRoundingMode .cse4 |c_ULTIMATE.start_main_~B2~0#1|))) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse5))) (fp.geq |c_ULTIMATE.start_main_~B2~0#1| (fp.neg .cse6)) (fp.geq |c_ULTIMATE.start_main_~A3~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (fp.leq |c_ULTIMATE.start_main_~A3~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (fp.leq |c_ULTIMATE.start_main_~B1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))) (fp.leq |c_ULTIMATE.start_main_~B2~0#1| (fp.neg .cse0)) (fp.geq |c_ULTIMATE.start_main_~A2~0#1| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (fp.geq |c_ULTIMATE.start_main_~B1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0))) (fp.leq |c_ULTIMATE.start_main_~E~0#1| .cse5) (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse5) (fp.leq |c_ULTIMATE.start_main_~A2~0#1| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))) (fp.leq |c_ULTIMATE.start_main_~A1~0#1| .cse6) (fp.geq |c_ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.geq |c_ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-12-13 12:21:33,502 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0)))) (and (fp.geq |c_ULTIMATE.start_main_~A1~0#1| .cse0) (fp.geq |c_ULTIMATE.start_main_~S~0#1| (fp.neg .cse1)) (= .cse2 |c_ULTIMATE.start_main_~S0~0#1|) (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (= |c_ULTIMATE.start_main_~S~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~A1~0#1| |c_ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E0~0#1| |c_ULTIMATE.start_main_~A2~0#1|)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E1~0#1| |c_ULTIMATE.start_main_~A3~0#1|)) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~S0~0#1| |c_ULTIMATE.start_main_~B1~0#1|)) (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~B2~0#1|))) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse3))) (fp.geq |c_ULTIMATE.start_main_~B2~0#1| (fp.neg .cse4)) (fp.geq |c_ULTIMATE.start_main_~A3~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (fp.leq |c_ULTIMATE.start_main_~A3~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (fp.leq |c_ULTIMATE.start_main_~B1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))) (fp.leq |c_ULTIMATE.start_main_~B2~0#1| (fp.neg .cse0)) (fp.geq |c_ULTIMATE.start_main_~A2~0#1| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (fp.geq |c_ULTIMATE.start_main_~B1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0))) (fp.leq |c_ULTIMATE.start_main_~E~0#1| .cse3) (fp.leq |c_ULTIMATE.start_main_~E0~0#1| .cse3) (fp.leq |c_ULTIMATE.start_main_~A2~0#1| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))) (fp.leq |c_ULTIMATE.start_main_~S~0#1| .cse1) (fp.leq |c_ULTIMATE.start_main_~A1~0#1| .cse4) (fp.geq |c_ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.geq |c_ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false