./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter2_reinit.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_reinit.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 77348271d6b3efbe553fb980482d4643f648de35ae877e068f35f88b7419ce44 --- 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-38b53e6 [2022-11-25 22:34:59,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:34:59,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:34:59,896 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:34:59,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:34:59,900 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:34:59,902 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:34:59,906 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:34:59,907 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:34:59,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:34:59,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:34:59,917 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:34:59,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:34:59,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:34:59,920 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:34:59,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:34:59,923 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:34:59,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:34:59,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:34:59,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:34:59,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:34:59,934 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:34:59,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:34:59,936 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:34:59,945 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:34:59,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:34:59,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:34:59,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:34:59,950 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:34:59,952 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:34:59,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:34:59,953 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:34:59,955 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:34:59,956 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:34:59,957 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:34:59,957 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:34:59,958 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:34:59,958 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:34:59,959 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:34:59,959 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:34:59,960 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:34:59,961 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-25 22:34:59,998 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:34:59,998 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:34:59,999 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:34:59,999 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:35:00,000 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:35:00,001 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:35:00,001 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:35:00,001 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:35:00,001 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:35:00,002 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 22:35:00,003 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:35:00,003 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:35:00,003 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 22:35:00,003 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 22:35:00,003 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:35:00,004 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 22:35:00,004 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 22:35:00,004 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 22:35:00,005 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:35:00,005 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:35:00,005 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 22:35:00,005 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:35:00,005 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:35:00,005 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 22:35:00,006 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:35:00,006 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 22:35:00,006 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:35:00,007 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 22:35:00,007 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:35:00,007 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 22:35:00,007 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:35:00,008 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:35:00,008 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:35:00,008 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:35:00,008 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 22:35:00,008 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:35:00,009 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 22:35:00,009 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 22:35:00,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 22:35:00,009 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 22:35:00,009 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:35:00,009 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/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_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77348271d6b3efbe553fb980482d4643f648de35ae877e068f35f88b7419ce44 [2022-11-25 22:35:00,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:35:00,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:35:00,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:35:00,353 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:35:00,353 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:35:00,355 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/float-benchs/filter2_reinit.c [2022-11-25 22:35:03,386 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:35:03,554 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:35:03,556 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/sv-benchmarks/c/float-benchs/filter2_reinit.c [2022-11-25 22:35:03,563 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/data/8289e3a29/089513c8e8624715968d5d8b69f3ca47/FLAG550952c1f [2022-11-25 22:35:03,578 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/data/8289e3a29/089513c8e8624715968d5d8b69f3ca47 [2022-11-25 22:35:03,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:35:03,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:35:03,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:35:03,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:35:03,589 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:35:03,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:35:03" (1/1) ... [2022-11-25 22:35:03,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:03, skipping insertion in model container [2022-11-25 22:35:03,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:35:03" (1/1) ... [2022-11-25 22:35:03,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:35:03,616 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:35:03,793 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_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/sv-benchmarks/c/float-benchs/filter2_reinit.c[700,713] [2022-11-25 22:35:03,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:35:03,818 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 22:35:03,876 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_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/sv-benchmarks/c/float-benchs/filter2_reinit.c[700,713] [2022-11-25 22:35:03,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:35:03,911 INFO L208 MainTranslator]: Completed translation [2022-11-25 22:35:03,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:03 WrapperNode [2022-11-25 22:35:03,912 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:35:03,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 22:35:03,913 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 22:35:03,913 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 22:35:03,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:03" (1/1) ... [2022-11-25 22:35:03,928 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:03" (1/1) ... [2022-11-25 22:35:03,945 INFO L138 Inliner]: procedures = 15, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2022-11-25 22:35:03,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 22:35:03,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 22:35:03,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 22:35:03,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 22:35:03,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:03" (1/1) ... [2022-11-25 22:35:03,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:03" (1/1) ... [2022-11-25 22:35:03,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:03" (1/1) ... [2022-11-25 22:35:03,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:03" (1/1) ... [2022-11-25 22:35:03,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:03" (1/1) ... [2022-11-25 22:35:03,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:03" (1/1) ... [2022-11-25 22:35:03,980 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:03" (1/1) ... [2022-11-25 22:35:03,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:03" (1/1) ... [2022-11-25 22:35:03,982 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 22:35:03,983 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 22:35:03,983 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 22:35:03,983 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 22:35:03,984 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:03" (1/1) ... [2022-11-25 22:35:03,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:35:03,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:35:04,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 22:35:04,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 22:35:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 22:35:04,062 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 22:35:04,062 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 22:35:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 22:35:04,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 22:35:04,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 22:35:04,140 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 22:35:04,142 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 22:35:04,332 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 22:35:04,406 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 22:35:04,414 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 22:35:04,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:35:04 BoogieIcfgContainer [2022-11-25 22:35:04,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 22:35:04,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 22:35:04,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 22:35:04,423 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 22:35:04,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 10:35:03" (1/3) ... [2022-11-25 22:35:04,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721c4110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:35:04, skipping insertion in model container [2022-11-25 22:35:04,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:03" (2/3) ... [2022-11-25 22:35:04,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721c4110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:35:04, skipping insertion in model container [2022-11-25 22:35:04,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:35:04" (3/3) ... [2022-11-25 22:35:04,427 INFO L112 eAbstractionObserver]: Analyzing ICFG filter2_reinit.c [2022-11-25 22:35:04,446 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 22:35:04,446 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 22:35:04,508 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 22:35:04,516 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6aca049f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 22:35:04,516 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 22:35:04,521 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 22:35:04,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 22:35:04,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:35:04,530 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:35:04,531 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:35:04,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:35:04,539 INFO L85 PathProgramCache]: Analyzing trace with hash 501115960, now seen corresponding path program 1 times [2022-11-25 22:35:04,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 22:35:04,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362064489] [2022-11-25 22:35:04,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:35:04,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 22:35:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 22:35:04,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 22:35:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 22:35:04,763 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-25 22:35:04,766 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 22:35:04,768 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 22:35:04,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 22:35:04,775 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2022-11-25 22:35:04,782 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 22:35:04,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 10:35:04 BoogieIcfgContainer [2022-11-25 22:35:04,819 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 22:35:04,819 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 22:35:04,819 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 22:35:04,820 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 22:35:04,820 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:35:04" (3/4) ... [2022-11-25 22:35:04,824 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 22:35:04,824 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 22:35:04,825 INFO L158 Benchmark]: Toolchain (without parser) took 1242.34ms. Allocated memory is still 136.3MB. Free memory was 97.7MB in the beginning and 76.7MB in the end (delta: 21.1MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2022-11-25 22:35:04,825 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 109.1MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 22:35:04,826 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.01ms. Allocated memory is still 136.3MB. Free memory was 97.7MB in the beginning and 108.2MB in the end (delta: -10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 22:35:04,827 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.49ms. Allocated memory is still 136.3MB. Free memory was 108.2MB in the beginning and 106.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 22:35:04,827 INFO L158 Benchmark]: Boogie Preprocessor took 34.28ms. Allocated memory is still 136.3MB. Free memory was 106.9MB in the beginning and 105.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 22:35:04,828 INFO L158 Benchmark]: RCFGBuilder took 434.13ms. Allocated memory is still 136.3MB. Free memory was 105.5MB in the beginning and 92.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 22:35:04,829 INFO L158 Benchmark]: TraceAbstraction took 399.51ms. Allocated memory is still 136.3MB. Free memory was 91.7MB in the beginning and 77.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-25 22:35:04,829 INFO L158 Benchmark]: Witness Printer took 4.81ms. Allocated memory is still 136.3MB. Free memory was 77.1MB in the beginning and 76.7MB in the end (delta: 403.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 22:35:04,832 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.25ms. Allocated memory is still 109.1MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.01ms. Allocated memory is still 136.3MB. Free memory was 97.7MB in the beginning and 108.2MB in the end (delta: -10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.49ms. Allocated memory is still 136.3MB. Free memory was 108.2MB in the beginning and 106.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.28ms. Allocated memory is still 136.3MB. Free memory was 106.9MB in the beginning and 105.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 434.13ms. Allocated memory is still 136.3MB. Free memory was 105.5MB in the beginning and 92.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 399.51ms. Allocated memory is still 136.3MB. Free memory was 91.7MB in the beginning and 77.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Witness Printer took 4.81ms. Allocated memory is still 136.3MB. Free memory was 77.1MB in the beginning and 76.7MB in the end (delta: 403.7kB). 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: 18]: 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 53, overapproximation of to_real at line 31, overapproximation of someBinaryArithmeticDOUBLEoperation at line 51. Possible FailurePath: [L23] double E, E0, E1, S0, S1, S; [L24] int i; [L26] E = __VERIFIER_nondet_double() [L27] E0 = __VERIFIER_nondet_double() [L28] CALL assume_abort_if_not(E >= 0. && E <= 1.) VAL [\old(cond)=1] [L16] COND FALSE !(!cond) [L28] RET assume_abort_if_not(E >= 0. && E <= 1.) [L29] CALL assume_abort_if_not(E0 >= 0. && E0 <= 1.) VAL [\old(cond)=1] [L16] COND FALSE !(!cond) [L29] RET assume_abort_if_not(E0 >= 0. && E0 <= 1.) [L31] S0 = 0 [L32] S = 0 [L34] i = 0 VAL [i=0] [L34] COND TRUE i <= 1000000 [L36] E1 = E0 [L37] E0 = E [L39] E = __VERIFIER_nondet_double() [L40] CALL assume_abort_if_not(E >= 0. && E <= 1.) VAL [\old(cond)=1] [L16] COND FALSE !(!cond) [L40] RET assume_abort_if_not(E >= 0. && E <= 1.) VAL [E=53, E=53, E=53, i=0] [L42] COND TRUE __VERIFIER_nondet_int() [L43] E1 = E [L44] E0 = E [L45] S0 = E [L46] S = E [L49] S1 = S0 [L50] S0 = S [L51] S = 0.7*E - E0*1.3 + E1*1.1 + S0*1.4 - S1*0.7 [L53] CALL __VERIFIER_assert(S >= -4. && S <= 4.) [L18] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L18] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 1, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 22:35:04,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/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_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_reinit.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 77348271d6b3efbe553fb980482d4643f648de35ae877e068f35f88b7419ce44 --- 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-38b53e6 [2022-11-25 22:35:07,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 22:35:07,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 22:35:07,423 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 22:35:07,423 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 22:35:07,430 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 22:35:07,431 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 22:35:07,433 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 22:35:07,435 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 22:35:07,436 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 22:35:07,437 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 22:35:07,438 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 22:35:07,438 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 22:35:07,439 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 22:35:07,440 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 22:35:07,442 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 22:35:07,442 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 22:35:07,443 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 22:35:07,445 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 22:35:07,447 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 22:35:07,448 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 22:35:07,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 22:35:07,451 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 22:35:07,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 22:35:07,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 22:35:07,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 22:35:07,456 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 22:35:07,457 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 22:35:07,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 22:35:07,458 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 22:35:07,459 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 22:35:07,459 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 22:35:07,460 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 22:35:07,461 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 22:35:07,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 22:35:07,462 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 22:35:07,463 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 22:35:07,463 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 22:35:07,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 22:35:07,465 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 22:35:07,465 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 22:35:07,466 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-25 22:35:07,490 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 22:35:07,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 22:35:07,490 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 22:35:07,491 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 22:35:07,491 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 22:35:07,492 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 22:35:07,492 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 22:35:07,492 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 22:35:07,492 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 22:35:07,493 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 22:35:07,493 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 22:35:07,493 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 22:35:07,494 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 22:35:07,494 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 22:35:07,494 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 22:35:07,495 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 22:35:07,495 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 22:35:07,495 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 22:35:07,495 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 22:35:07,496 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 22:35:07,496 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 22:35:07,496 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 22:35:07,496 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 22:35:07,497 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 22:35:07,497 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 22:35:07,497 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 22:35:07,497 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 22:35:07,498 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 22:35:07,498 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 22:35:07,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:35:07,498 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 22:35:07,498 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 22:35:07,499 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 22:35:07,499 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-25 22:35:07,499 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 22:35:07,499 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 22:35:07,500 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 22:35:07,500 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 22:35:07,500 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/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_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77348271d6b3efbe553fb980482d4643f648de35ae877e068f35f88b7419ce44 [2022-11-25 22:35:07,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 22:35:07,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 22:35:07,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 22:35:07,944 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 22:35:07,944 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 22:35:07,946 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/float-benchs/filter2_reinit.c [2022-11-25 22:35:11,014 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 22:35:11,277 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 22:35:11,277 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/sv-benchmarks/c/float-benchs/filter2_reinit.c [2022-11-25 22:35:11,284 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/data/97271240a/4cc02a6fda94491a95738a0257063b1f/FLAGc18102568 [2022-11-25 22:35:11,297 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/data/97271240a/4cc02a6fda94491a95738a0257063b1f [2022-11-25 22:35:11,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 22:35:11,301 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 22:35:11,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 22:35:11,303 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 22:35:11,306 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 22:35:11,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:35:11" (1/1) ... [2022-11-25 22:35:11,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46a6eda4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:11, skipping insertion in model container [2022-11-25 22:35:11,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 10:35:11" (1/1) ... [2022-11-25 22:35:11,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 22:35:11,341 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 22:35:11,485 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_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/sv-benchmarks/c/float-benchs/filter2_reinit.c[700,713] [2022-11-25 22:35:11,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:35:11,517 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 22:35:11,531 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_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/sv-benchmarks/c/float-benchs/filter2_reinit.c[700,713] [2022-11-25 22:35:11,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 22:35:11,552 INFO L208 MainTranslator]: Completed translation [2022-11-25 22:35:11,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:11 WrapperNode [2022-11-25 22:35:11,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 22:35:11,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 22:35:11,555 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 22:35:11,555 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 22:35:11,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:11" (1/1) ... [2022-11-25 22:35:11,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:11" (1/1) ... [2022-11-25 22:35:11,613 INFO L138 Inliner]: procedures = 16, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2022-11-25 22:35:11,613 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 22:35:11,614 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 22:35:11,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 22:35:11,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 22:35:11,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:11" (1/1) ... [2022-11-25 22:35:11,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:11" (1/1) ... [2022-11-25 22:35:11,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:11" (1/1) ... [2022-11-25 22:35:11,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:11" (1/1) ... [2022-11-25 22:35:11,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:11" (1/1) ... [2022-11-25 22:35:11,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:11" (1/1) ... [2022-11-25 22:35:11,665 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:11" (1/1) ... [2022-11-25 22:35:11,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:11" (1/1) ... [2022-11-25 22:35:11,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 22:35:11,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 22:35:11,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 22:35:11,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 22:35:11,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:11" (1/1) ... [2022-11-25 22:35:11,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 22:35:11,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:35:11,716 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 22:35:11,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 22:35:11,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 22:35:11,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 22:35:11,773 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 22:35:11,773 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 22:35:11,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 22:35:11,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 22:35:11,870 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 22:35:11,872 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 22:35:14,330 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 22:35:14,337 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 22:35:14,338 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 22:35:14,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:35:14 BoogieIcfgContainer [2022-11-25 22:35:14,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 22:35:14,342 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 22:35:14,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 22:35:14,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 22:35:14,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 10:35:11" (1/3) ... [2022-11-25 22:35:14,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ffe0477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:35:14, skipping insertion in model container [2022-11-25 22:35:14,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 10:35:11" (2/3) ... [2022-11-25 22:35:14,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ffe0477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 10:35:14, skipping insertion in model container [2022-11-25 22:35:14,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 10:35:14" (3/3) ... [2022-11-25 22:35:14,365 INFO L112 eAbstractionObserver]: Analyzing ICFG filter2_reinit.c [2022-11-25 22:35:14,384 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 22:35:14,384 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 22:35:14,429 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 22:35:14,437 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2559865, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 22:35:14,438 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 22:35:14,442 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 22:35:14,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 22:35:14,455 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:35:14,456 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:35:14,456 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:35:14,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:35:14,461 INFO L85 PathProgramCache]: Analyzing trace with hash 526466326, now seen corresponding path program 1 times [2022-11-25 22:35:14,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:35:14,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395277936] [2022-11-25 22:35:14,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:35:14,473 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-11-25 22:35:14,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:35:14,474 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/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-11-25 22:35:14,476 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/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-11-25 22:35:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:35:15,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 22:35:15,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:35:15,906 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-25 22:35:15,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:35:15,907 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:35:15,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1395277936] [2022-11-25 22:35:15,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1395277936] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:35:15,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:35:15,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 22:35:15,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201419335] [2022-11-25 22:35:15,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:35:15,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 22:35:15,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:35:15,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 22:35:15,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 22:35:15,947 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:35:15,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:35:15,968 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-11-25 22:35:15,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 22:35:15,972 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-11-25 22:35:15,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:35:15,979 INFO L225 Difference]: With dead ends: 41 [2022-11-25 22:35:15,979 INFO L226 Difference]: Without dead ends: 18 [2022-11-25 22:35:15,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 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-11-25 22:35:15,988 INFO L413 NwaCegarLoop]: 25 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, 25 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-11-25 22:35:15,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 22:35:16,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-25 22:35:16,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-25 22:35:16,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 22:35:16,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-11-25 22:35:16,037 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 23 [2022-11-25 22:35:16,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:35:16,038 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-11-25 22:35:16,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 22:35:16,040 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-11-25 22:35:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 22:35:16,042 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:35:16,043 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:35:16,083 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/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-11-25 22:35:16,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/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-11-25 22:35:16,268 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:35:16,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:35:16,269 INFO L85 PathProgramCache]: Analyzing trace with hash -398587304, now seen corresponding path program 1 times [2022-11-25 22:35:16,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:35:16,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736329146] [2022-11-25 22:35:16,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:35:16,270 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-11-25 22:35:16,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:35:16,271 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/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-11-25 22:35:16,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/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-11-25 22:35:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:35:30,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 22:35:30,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:36:03,950 WARN L837 $PredicateComparison]: unable to prove that (or (and (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) (fp.neg .cse5))))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) is different from false [2022-11-25 22:36:34,814 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) (fp.neg .cse5))))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) is different from false [2022-11-25 22:36:36,860 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) (fp.neg .cse5))))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) is different from true [2022-11-25 22:36:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-25 22:36:36,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:36:36,861 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:36:36,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736329146] [2022-11-25 22:36:36,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736329146] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:36:36,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:36:36,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 22:36:36,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417799061] [2022-11-25 22:36:36,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:36:36,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 22:36:36,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:36:36,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 22:36:36,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=27, Unknown=3, NotChecked=22, Total=72 [2022-11-25 22:36:36,870 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 22:36:39,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 22:36:40,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:36:40,144 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-11-25 22:36:40,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 22:36:40,146 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-11-25 22:36:40,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:36:40,147 INFO L225 Difference]: With dead ends: 30 [2022-11-25 22:36:40,147 INFO L226 Difference]: Without dead ends: 28 [2022-11-25 22:36:40,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=25, Invalid=36, Unknown=3, NotChecked=26, Total=90 [2022-11-25 22:36:40,149 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-25 22:36:40,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 45 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 1 Unknown, 34 Unchecked, 3.2s Time] [2022-11-25 22:36:40,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-25 22:36:40,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-11-25 22:36:40,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 22:36:40,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-25 22:36:40,162 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-11-25 22:36:40,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:36:40,163 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-25 22:36:40,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 22:36:40,163 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-25 22:36:40,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 22:36:40,166 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:36:40,166 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:36:40,195 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/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-11-25 22:36:40,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/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-11-25 22:36:40,367 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:36:40,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:36:40,368 INFO L85 PathProgramCache]: Analyzing trace with hash -398527722, now seen corresponding path program 1 times [2022-11-25 22:36:40,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:36:40,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036826868] [2022-11-25 22:36:40,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:36:40,369 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-11-25 22:36:40,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:36:40,371 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/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-11-25 22:36:40,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/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-11-25 22:36:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:36:50,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-25 22:36:50,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:39:37,582 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 4.0))) (let ((.cse3 (fp.neg .cse2)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse7 (fp.mul roundNearestTiesToEven .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0)))) (.cse8 (fp.mul roundNearestTiesToEven .cse9 .cse4)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (and (exists ((|ULTIMATE.start_main_~E0~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse5)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse6)) .cse7) .cse8))) (and (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse0) (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse3)))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (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_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse5)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse6)) .cse7) .cse8) .cse3)) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse0))) (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~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| .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_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse5)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse6)) .cse7) .cse8) .cse2)) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse0))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse0)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))))) is different from false [2022-11-25 22:40:09,572 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse3 (fp.mul roundNearestTiesToEven .cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0)))) (.cse4 (fp.mul roundNearestTiesToEven .cse7 .cse0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (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_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse1)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse2)) .cse3) .cse4) (fp.neg .cse5))) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse6))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse6))) (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse6))) (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| .cse6) (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_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse1)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse2)) .cse3) .cse4) .cse5)) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse6))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse6)))))))) is different from false [2022-11-25 22:40:11,625 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse3 (fp.mul roundNearestTiesToEven .cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0)))) (.cse4 (fp.mul roundNearestTiesToEven .cse7 .cse0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~E1~0#1| (_ FloatingPoint 11 53))) (and (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_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse1)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse2)) .cse3) .cse4) (fp.neg .cse5))) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse6))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse6))) (fp.geq |ULTIMATE.start_main_~E1~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E1~0#1| .cse6))) (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| .cse6) (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_~E0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E0~0#1| .cse1)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~E1~0#1| .cse2)) .cse3) .cse4) .cse5)) (fp.geq |ULTIMATE.start_main_~E0~0#1| (_ +zero 11 53)) (fp.leq |ULTIMATE.start_main_~E0~0#1| .cse6))) (fp.leq |ULTIMATE.start_main_~E~0#1| .cse6)))))))) is different from true [2022-11-25 22:40:11,626 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 22:40:11,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 22:40:11,626 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:40:11,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036826868] [2022-11-25 22:40:11,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036826868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 22:40:11,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 22:40:11,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 22:40:11,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510409779] [2022-11-25 22:40:11,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 22:40:11,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 22:40:11,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-25 22:40:11,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 22:40:11,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=60, Unknown=3, NotChecked=34, Total=132 [2022-11-25 22:40:11,630 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 22:40:15,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 22:40:17,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-25 22:40:17,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 22:40:17,487 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-11-25 22:40:17,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 22:40:17,488 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2022-11-25 22:40:17,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 22:40:17,490 INFO L225 Difference]: With dead ends: 31 [2022-11-25 22:40:17,490 INFO L226 Difference]: Without dead ends: 29 [2022-11-25 22:40:17,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=40, Invalid=75, Unknown=3, NotChecked=38, Total=156 [2022-11-25 22:40:17,492 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-11-25 22:40:17,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 72 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 2 Unknown, 37 Unchecked, 5.7s Time] [2022-11-25 22:40:17,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-25 22:40:17,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-11-25 22:40:17,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-25 22:40:17,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-25 22:40:17,500 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-11-25 22:40:17,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 22:40:17,500 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-25 22:40:17,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 22:40:17,501 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-25 22:40:17,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-25 22:40:17,502 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 22:40:17,502 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 22:40:17,543 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/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)] Ended with exit code 0 [2022-11-25 22:40:17,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/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-11-25 22:40:17,723 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 22:40:17,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 22:40:17,724 INFO L85 PathProgramCache]: Analyzing trace with hash 497959587, now seen corresponding path program 1 times [2022-11-25 22:40:17,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-25 22:40:17,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477780336] [2022-11-25 22:40:17,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:40:17,725 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-11-25 22:40:17,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/mathsat [2022-11-25 22:40:17,726 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/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-11-25 22:40:17,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/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 (5)] Waiting until timeout for monitored process [2022-11-25 22:40:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:40:35,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 22:40:35,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:41:07,437 WARN L837 $PredicateComparison]: unable to prove that (or (and (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) (fp.neg .cse5))))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) is different from false [2022-11-25 22:41:39,456 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) (fp.neg .cse5))))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) is different from false [2022-11-25 22:41:41,514 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 13.0 10.0))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 5.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 7.0 10.0))) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 4.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) (fp.neg .cse5))))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 |ULTIMATE.start_main_~S0~0#1|) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse2)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse3)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse4)) (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~S0~0#1| .cse1)) .cse5)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) is different from true [2022-11-25 22:41:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 1 not checked. [2022-11-25 22:41:41,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:41:53,655 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~S0~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2022-11-25 22:41:55,860 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E1~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~S~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~S0~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2022-11-25 22:42:07,198 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from false [2022-11-25 22:42:09,342 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~E~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 (fp.neg .cse1)))) is different from true [2022-11-25 22:42:38,136 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 4.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (forall ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse1)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse2)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse3)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse0)) .cse4) (not (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53))) (not (fp.leq |ULTIMATE.start_main_~E~0#1| .cse5)))) (forall ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse1)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse2)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse3)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse0)) (fp.neg .cse4)) (not (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53))) (not (fp.leq |ULTIMATE.start_main_~E~0#1| .cse5)))))) is different from false [2022-11-25 22:42:40,393 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 4.0)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (forall ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (or (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse1)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse2)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse3)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse0)) .cse4) (not (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53))) (not (fp.leq |ULTIMATE.start_main_~E~0#1| .cse5)))) (forall ((|ULTIMATE.start_main_~E~0#1| (_ FloatingPoint 11 53))) (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 |ULTIMATE.start_main_~E~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse1)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse2)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse3)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~E~0#1| .cse0)) (fp.neg .cse4)) (not (fp.geq |ULTIMATE.start_main_~E~0#1| (_ +zero 11 53))) (not (fp.leq |ULTIMATE.start_main_~E~0#1| .cse5)))))) is different from true [2022-11-25 22:42:40,395 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-25 22:42:40,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477780336] [2022-11-25 22:42:40,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [477780336] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:42:40,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1805842975] [2022-11-25 22:42:40,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:42:40,396 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-25 22:42:40,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-25 22:42:40,404 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-25 22:42:40,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-11-25 22:42:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 22:42:55,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 29 conjunts are in the unsatisfiable core [2022-11-25 22:42:55,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 22:43:40,612 WARN L837 $PredicateComparison]: unable to prove that (and (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0))) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0))) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0))) (.cse1 (fp.neg .cse2)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse5)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse6)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse7)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse4)))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 .cse2) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)))))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (or (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53)) (not (fp.leq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse5)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse6)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse7)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse4)) .cse2)))) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (and (not (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse4 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse5)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse6)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse7)) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse4)) .cse1)) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-25 22:44:00,265 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1) (fp.leq |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-25 22:45:27,653 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_assume_abort_if_not_#in~cond| c_assume_abort_if_not_~cond) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1) (fp.leq |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-25 22:45:47,275 WARN L837 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse2)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1) (fp.leq |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven) (not (= |c_assume_abort_if_not_#in~cond| (_ bv0 32)))) is different from false [2022-11-25 22:46:24,301 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.leq |c_ULTIMATE.start_main_~E~0#1| .cse0) (fp.geq |c_ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse3)))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.geq .cse1 (fp.neg .cse2)) (fp.leq .cse1 .cse2) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-25 22:46:45,213 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~E~0#1| |c_ULTIMATE.start_main_~S0~0#1|) (= |c_ULTIMATE.start_main_~E~0#1| |c_ULTIMATE.start_main_~E1~0#1|) (fp.leq |c_ULTIMATE.start_main_~E~0#1| .cse0) (= |c_ULTIMATE.start_main_~S~0#1| |c_ULTIMATE.start_main_~E~0#1|) (= |c_ULTIMATE.start_main_~E~0#1| |c_ULTIMATE.start_main_~E0~0#1|) (fp.geq |c_ULTIMATE.start_main_~E~0#1| (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~S0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 10.0)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode .cse3 |ULTIMATE.start_main_~S0~0#1|) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 13.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 11.0 10.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 7.0 5.0)))) (fp.mul c_currentRoundingMode |ULTIMATE.start_main_~S0~0#1| .cse3)))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 4.0))) (and (fp.geq .cse1 (fp.neg .cse2)) (fp.leq .cse1 .cse2) (fp.leq |ULTIMATE.start_main_~S0~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~S0~0#1| (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-11-25 22:47:42,938 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 17 not checked. [2022-11-25 22:47:42,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 22:47:48,067 WARN L233 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-25 22:48:29,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1805842975] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 22:48:29,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548324514] [2022-11-25 22:48:29,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 22:48:29,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 22:48:29,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 22:48:29,363 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 22:48:29,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e6d0b3-dbfd-40ff-8e2f-0c3666d05ab7/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process