./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/drift_tenth.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/drift_tenth.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba --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 cbe9305dfa705c6adeb45241a85cbda41a40d96daaf057706b199b2a64bbcd77 --- 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-b5237d8 [2022-11-22 01:58:53,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:58:53,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:58:53,174 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:58:53,174 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:58:53,175 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:58:53,177 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:58:53,179 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:58:53,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:58:53,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:58:53,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:58:53,184 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:58:53,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:58:53,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:58:53,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:58:53,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:58:53,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:58:53,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:58:53,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:58:53,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:58:53,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:58:53,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:58:53,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:58:53,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:58:53,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:58:53,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:58:53,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:58:53,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:58:53,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:58:53,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:58:53,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:58:53,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:58:53,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:58:53,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:58:53,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:58:53,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:58:53,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:58:53,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:58:53,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:58:53,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:58:53,216 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:58:53,217 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-22 01:58:53,241 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:58:53,242 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:58:53,242 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:58:53,243 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:58:53,244 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:58:53,244 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:58:53,244 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:58:53,244 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:58:53,245 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:58:53,245 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 01:58:53,245 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:58:53,246 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:58:53,246 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 01:58:53,246 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 01:58:53,247 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:58:53,247 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 01:58:53,247 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 01:58:53,247 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 01:58:53,248 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:58:53,249 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:58:53,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 01:58:53,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:58:53,250 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:58:53,250 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 01:58:53,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:58:53,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 01:58:53,251 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:58:53,251 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 01:58:53,251 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:58:53,252 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 01:58:53,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:58:53,252 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:58:53,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:58:53,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:58:53,253 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 01:58:53,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:58:53,254 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 01:58:53,254 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 01:58:53,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 01:58:53,254 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 01:58:53,255 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:58:53,255 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_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/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_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba 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 -> cbe9305dfa705c6adeb45241a85cbda41a40d96daaf057706b199b2a64bbcd77 [2022-11-22 01:58:53,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:58:53,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:58:53,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:58:53,561 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:58:53,562 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:58:53,563 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/float-benchs/drift_tenth.c [2022-11-22 01:58:56,626 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:58:56,825 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:58:56,826 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/sv-benchmarks/c/float-benchs/drift_tenth.c [2022-11-22 01:58:56,832 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/data/6a16bed26/7424690948ee4a17837595b36a927143/FLAGc6d4ee934 [2022-11-22 01:58:56,848 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/data/6a16bed26/7424690948ee4a17837595b36a927143 [2022-11-22 01:58:56,851 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:58:56,852 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:58:56,854 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:58:56,854 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:58:56,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:58:56,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:58:56" (1/1) ... [2022-11-22 01:58:56,860 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a6233cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:56, skipping insertion in model container [2022-11-22 01:58:56,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:58:56" (1/1) ... [2022-11-22 01:58:56,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:58:56,882 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:58:57,036 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_6b0cb40c-ab16-44b2-b9d8-75e80b875502/sv-benchmarks/c/float-benchs/drift_tenth.c[348,361] [2022-11-22 01:58:57,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:58:57,080 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:58:57,093 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_6b0cb40c-ab16-44b2-b9d8-75e80b875502/sv-benchmarks/c/float-benchs/drift_tenth.c[348,361] [2022-11-22 01:58:57,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:58:57,109 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:58:57,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:57 WrapperNode [2022-11-22 01:58:57,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:58:57,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:58:57,111 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:58:57,112 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:58:57,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:57" (1/1) ... [2022-11-22 01:58:57,126 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:57" (1/1) ... [2022-11-22 01:58:57,143 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 31 [2022-11-22 01:58:57,144 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:58:57,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:58:57,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:58:57,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:58:57,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:57" (1/1) ... [2022-11-22 01:58:57,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:57" (1/1) ... [2022-11-22 01:58:57,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:57" (1/1) ... [2022-11-22 01:58:57,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:57" (1/1) ... [2022-11-22 01:58:57,180 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:57" (1/1) ... [2022-11-22 01:58:57,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:57" (1/1) ... [2022-11-22 01:58:57,193 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:57" (1/1) ... [2022-11-22 01:58:57,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:57" (1/1) ... [2022-11-22 01:58:57,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:58:57,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:58:57,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:58:57,198 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:58:57,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:57" (1/1) ... [2022-11-22 01:58:57,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:58:57,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:58:57,226 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:58:57,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:58:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:58:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:58:57,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:58:57,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 01:58:57,362 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:58:57,364 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:58:57,520 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:58:57,544 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:58:57,544 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-22 01:58:57,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:58:57 BoogieIcfgContainer [2022-11-22 01:58:57,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:58:57,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:58:57,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:58:57,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:58:57,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:58:56" (1/3) ... [2022-11-22 01:58:57,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35160229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:58:57, skipping insertion in model container [2022-11-22 01:58:57,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:58:57" (2/3) ... [2022-11-22 01:58:57,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35160229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:58:57, skipping insertion in model container [2022-11-22 01:58:57,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:58:57" (3/3) ... [2022-11-22 01:58:57,557 INFO L112 eAbstractionObserver]: Analyzing ICFG drift_tenth.c [2022-11-22 01:58:57,578 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:58:57,579 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-22 01:58:57,638 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:58:57,646 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;@7c738b1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:58:57,646 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-22 01:58:57,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:58:57,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-22 01:58:57,662 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:58:57,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-22 01:58:57,663 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:58:57,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:58:57,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1912039, now seen corresponding path program 1 times [2022-11-22 01:58:57,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:58:57,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067920448] [2022-11-22 01:58:57,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:58:57,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:58:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:58:57,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:58:57,903 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:58:57,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067920448] [2022-11-22 01:58:57,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067920448] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:58:57,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:58:57,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 01:58:57,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343047629] [2022-11-22 01:58:57,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:58:57,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:58:57,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:58:57,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:58:57,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:58:57,985 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:58:58,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:58:58,012 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-11-22 01:58:58,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:58:58,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-22 01:58:58,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:58:58,023 INFO L225 Difference]: With dead ends: 13 [2022-11-22 01:58:58,023 INFO L226 Difference]: Without dead ends: 6 [2022-11-22 01:58:58,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:58:58,029 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:58:58,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:58:58,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2022-11-22 01:58:58,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2022-11-22 01:58:58,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:58:58,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2022-11-22 01:58:58,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2022-11-22 01:58:58,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:58:58,062 INFO L495 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2022-11-22 01:58:58,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:58:58,063 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2022-11-22 01:58:58,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-22 01:58:58,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:58:58,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-22 01:58:58,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 01:58:58,064 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:58:58,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:58:58,065 INFO L85 PathProgramCache]: Analyzing trace with hash 59200132, now seen corresponding path program 1 times [2022-11-22 01:58:58,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:58:58,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793023740] [2022-11-22 01:58:58,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:58:58,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:58:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:58:58,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:58:58,127 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:58:58,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793023740] [2022-11-22 01:58:58,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793023740] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:58:58,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507609793] [2022-11-22 01:58:58,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:58:58,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:58:58,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:58:58,132 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:58:58,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 01:58:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:58:58,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 01:58:58,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:58:58,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:58:58,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:58:58,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:58:58,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507609793] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:58:58,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1801152666] [2022-11-22 01:58:58,311 INFO L159 IcfgInterpreter]: Started Sifa with 5 locations of interest [2022-11-22 01:58:58,311 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:58:58,315 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:58:58,321 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:58:58,322 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:58:58,673 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:58:58,803 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '69#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-22 01:58:58,804 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:58:58,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:58:58,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-11-22 01:58:58,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364008834] [2022-11-22 01:58:58,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:58:58,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 01:58:58,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:58:58,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 01:58:58,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-22 01:58:58,808 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:58:58,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:58:58,827 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2022-11-22 01:58:58,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:58:58,828 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-22 01:58:58,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:58:58,828 INFO L225 Difference]: With dead ends: 12 [2022-11-22 01:58:58,828 INFO L226 Difference]: Without dead ends: 9 [2022-11-22 01:58:58,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-22 01:58:58,830 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:58:58,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:58:58,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-11-22 01:58:58,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-11-22 01:58:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:58:58,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-11-22 01:58:58,835 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2022-11-22 01:58:58,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:58:58,835 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-11-22 01:58:58,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:58:58,836 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-11-22 01:58:58,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 01:58:58,837 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:58:58,837 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2022-11-22 01:58:58,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-22 01:58:59,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:58:59,057 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:58:59,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:58:59,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1672991705, now seen corresponding path program 2 times [2022-11-22 01:58:59,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:58:59,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590864739] [2022-11-22 01:58:59,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:58:59,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:58:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:58:59,175 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:58:59,175 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 01:58:59,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590864739] [2022-11-22 01:58:59,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590864739] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 01:58:59,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561523421] [2022-11-22 01:58:59,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 01:58:59,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:58:59,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:58:59,178 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:58:59,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-22 01:58:59,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-22 01:58:59,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:58:59,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 01:58:59,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:58:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:58:59,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:58:59,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:58:59,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561523421] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:58:59,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [644294446] [2022-11-22 01:58:59,350 INFO L159 IcfgInterpreter]: Started Sifa with 5 locations of interest [2022-11-22 01:58:59,351 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 01:58:59,351 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 01:58:59,351 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 01:58:59,352 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 01:58:59,442 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 01:58:59,552 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '158#(and (<= 10 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| |ULTIMATE.start___VERIFIER_assert_#in~cond#1|) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-22 01:58:59,552 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 01:58:59,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 01:58:59,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-11-22 01:58:59,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419725615] [2022-11-22 01:58:59,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 01:58:59,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-22 01:58:59,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 01:58:59,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-22 01:58:59,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2022-11-22 01:58:59,558 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:58:59,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:58:59,597 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-11-22 01:58:59,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-22 01:58:59,598 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-22 01:58:59,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:58:59,599 INFO L225 Difference]: With dead ends: 18 [2022-11-22 01:58:59,599 INFO L226 Difference]: Without dead ends: 15 [2022-11-22 01:58:59,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2022-11-22 01:58:59,603 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 01:58:59,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 01:58:59,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-22 01:58:59,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-22 01:58:59,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:58:59,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-11-22 01:58:59,618 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2022-11-22 01:58:59,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:58:59,620 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-11-22 01:58:59,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:58:59,620 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-11-22 01:58:59,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 01:58:59,621 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:58:59,621 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1] [2022-11-22 01:58:59,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-22 01:58:59,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:58:59,827 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:58:59,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:58:59,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1912037625, now seen corresponding path program 3 times [2022-11-22 01:58:59,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 01:58:59,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090624397] [2022-11-22 01:58:59,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:58:59,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 01:58:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 01:58:59,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 01:58:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 01:58:59,943 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-22 01:58:59,943 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 01:58:59,944 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-22 01:58:59,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 01:58:59,963 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1] [2022-11-22 01:58:59,967 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 01:59:00,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:59:00 BoogieIcfgContainer [2022-11-22 01:59:00,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 01:59:00,003 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 01:59:00,003 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 01:59:00,003 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 01:59:00,004 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:58:57" (3/4) ... [2022-11-22 01:59:00,007 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-22 01:59:00,007 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 01:59:00,008 INFO L158 Benchmark]: Toolchain (without parser) took 3155.51ms. Allocated memory was 138.4MB in the beginning and 190.8MB in the end (delta: 52.4MB). Free memory was 77.9MB in the beginning and 156.7MB in the end (delta: -78.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:59:00,008 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 138.4MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:59:00,008 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.32ms. Allocated memory was 138.4MB in the beginning and 190.8MB in the end (delta: 52.4MB). Free memory was 77.6MB in the beginning and 161.1MB in the end (delta: -83.5MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2022-11-22 01:59:00,009 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.78ms. Allocated memory is still 190.8MB. Free memory was 161.0MB in the beginning and 159.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 01:59:00,009 INFO L158 Benchmark]: Boogie Preprocessor took 51.44ms. Allocated memory is still 190.8MB. Free memory was 159.6MB in the beginning and 162.0MB in the end (delta: -2.5MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2022-11-22 01:59:00,009 INFO L158 Benchmark]: RCFGBuilder took 350.26ms. Allocated memory is still 190.8MB. Free memory was 162.0MB in the beginning and 151.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-22 01:59:00,010 INFO L158 Benchmark]: TraceAbstraction took 2453.05ms. Allocated memory is still 190.8MB. Free memory was 150.6MB in the beginning and 157.7MB in the end (delta: -7.1MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2022-11-22 01:59:00,010 INFO L158 Benchmark]: Witness Printer took 4.20ms. Allocated memory is still 190.8MB. Free memory was 157.7MB in the beginning and 156.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 01:59:00,012 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.29ms. Allocated memory is still 138.4MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.32ms. Allocated memory was 138.4MB in the beginning and 190.8MB in the end (delta: 52.4MB). Free memory was 77.6MB in the beginning and 161.1MB in the end (delta: -83.5MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.78ms. Allocated memory is still 190.8MB. Free memory was 161.0MB in the beginning and 159.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.44ms. Allocated memory is still 190.8MB. Free memory was 159.6MB in the beginning and 162.0MB in the end (delta: -2.5MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * RCFGBuilder took 350.26ms. Allocated memory is still 190.8MB. Free memory was 162.0MB in the beginning and 151.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2453.05ms. Allocated memory is still 190.8MB. Free memory was 150.6MB in the beginning and 157.7MB in the end (delta: -7.1MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. * Witness Printer took 4.20ms. Allocated memory is still 190.8MB. Free memory was 157.7MB in the beginning and 156.7MB in the end (delta: 1.0MB). 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: 6]: 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 17, overapproximation of someBinaryArithmeticFLOAToperation at line 15. Possible FailurePath: [L10] float tick = 1.f / 10.f; [L11] float time = 0.f; [L12] int i; [L14] i = 0 VAL [i=0, time=0] [L14] COND TRUE i < 10 [L15] time += tick [L14] i++ VAL [i=1] [L14] COND TRUE i < 10 [L15] time += tick [L14] i++ VAL [i=2] [L14] COND TRUE i < 10 [L15] time += tick [L14] i++ VAL [i=3] [L14] COND TRUE i < 10 [L15] time += tick [L14] i++ VAL [i=4] [L14] COND TRUE i < 10 [L15] time += tick [L14] i++ VAL [i=5] [L14] COND TRUE i < 10 [L15] time += tick [L14] i++ VAL [i=6] [L14] COND TRUE i < 10 [L15] time += tick [L14] i++ VAL [i=7] [L14] COND TRUE i < 10 [L15] time += tick [L14] i++ VAL [i=8] [L14] COND TRUE i < 10 [L15] time += tick [L14] i++ VAL [i=9] [L14] COND TRUE i < 10 [L15] time += tick [L14] i++ VAL [i=10] [L14] COND FALSE !(i < 10) [L17] CALL __VERIFIER_assert(time != 1.0) [L6] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L6] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 7 mSDtfsCounter, 34 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 80 SizeOfPredicates, 0 NumberOfNonLiveVariables, 89 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/33 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-22 01:59:00,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/drift_tenth.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba --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 cbe9305dfa705c6adeb45241a85cbda41a40d96daaf057706b199b2a64bbcd77 --- 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-b5237d8 [2022-11-22 01:59:02,617 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 01:59:02,619 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 01:59:02,641 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 01:59:02,642 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 01:59:02,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 01:59:02,644 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 01:59:02,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 01:59:02,648 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 01:59:02,649 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 01:59:02,650 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 01:59:02,652 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 01:59:02,652 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 01:59:02,653 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 01:59:02,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 01:59:02,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 01:59:02,657 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 01:59:02,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 01:59:02,660 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 01:59:02,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 01:59:02,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 01:59:02,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 01:59:02,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 01:59:02,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 01:59:02,672 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 01:59:02,673 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 01:59:02,673 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 01:59:02,674 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 01:59:02,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 01:59:02,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 01:59:02,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 01:59:02,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 01:59:02,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 01:59:02,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 01:59:02,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 01:59:02,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 01:59:02,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 01:59:02,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 01:59:02,693 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 01:59:02,694 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 01:59:02,695 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 01:59:02,696 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-22 01:59:02,745 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 01:59:02,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 01:59:02,751 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 01:59:02,751 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 01:59:02,752 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 01:59:02,752 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 01:59:02,752 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 01:59:02,753 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 01:59:02,753 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 01:59:02,753 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 01:59:02,753 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 01:59:02,754 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 01:59:02,755 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 01:59:02,755 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 01:59:02,755 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 01:59:02,755 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 01:59:02,756 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-22 01:59:02,756 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 01:59:02,756 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-22 01:59:02,756 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-22 01:59:02,757 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-22 01:59:02,757 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-22 01:59:02,757 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 01:59:02,757 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-22 01:59:02,757 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 01:59:02,758 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-22 01:59:02,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 01:59:02,758 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-22 01:59:02,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 01:59:02,759 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:59:02,759 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 01:59:02,759 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 01:59:02,759 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-22 01:59:02,759 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-22 01:59:02,760 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-22 01:59:02,760 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-22 01:59:02,760 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 01:59:02,760 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-22 01:59:02,760 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_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/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_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba 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 -> cbe9305dfa705c6adeb45241a85cbda41a40d96daaf057706b199b2a64bbcd77 [2022-11-22 01:59:03,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 01:59:03,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 01:59:03,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 01:59:03,215 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 01:59:03,216 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 01:59:03,217 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/float-benchs/drift_tenth.c [2022-11-22 01:59:06,401 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 01:59:06,579 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 01:59:06,580 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/sv-benchmarks/c/float-benchs/drift_tenth.c [2022-11-22 01:59:06,590 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/data/2d9b47e84/58713a4578e54f51b09daf5d5fa915e3/FLAGed6f6abe9 [2022-11-22 01:59:06,616 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/data/2d9b47e84/58713a4578e54f51b09daf5d5fa915e3 [2022-11-22 01:59:06,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 01:59:06,626 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 01:59:06,632 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 01:59:06,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 01:59:06,636 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 01:59:06,637 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:59:06" (1/1) ... [2022-11-22 01:59:06,638 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fc4a828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:06, skipping insertion in model container [2022-11-22 01:59:06,638 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:59:06" (1/1) ... [2022-11-22 01:59:06,646 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 01:59:06,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 01:59:06,830 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_6b0cb40c-ab16-44b2-b9d8-75e80b875502/sv-benchmarks/c/float-benchs/drift_tenth.c[348,361] [2022-11-22 01:59:06,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:59:06,858 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 01:59:06,870 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_6b0cb40c-ab16-44b2-b9d8-75e80b875502/sv-benchmarks/c/float-benchs/drift_tenth.c[348,361] [2022-11-22 01:59:06,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 01:59:06,887 INFO L208 MainTranslator]: Completed translation [2022-11-22 01:59:06,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:06 WrapperNode [2022-11-22 01:59:06,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 01:59:06,889 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 01:59:06,889 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 01:59:06,889 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 01:59:06,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:06" (1/1) ... [2022-11-22 01:59:06,911 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:06" (1/1) ... [2022-11-22 01:59:06,930 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 32 [2022-11-22 01:59:06,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 01:59:06,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 01:59:06,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 01:59:06,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 01:59:06,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:06" (1/1) ... [2022-11-22 01:59:06,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:06" (1/1) ... [2022-11-22 01:59:06,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:06" (1/1) ... [2022-11-22 01:59:06,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:06" (1/1) ... [2022-11-22 01:59:06,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:06" (1/1) ... [2022-11-22 01:59:06,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:06" (1/1) ... [2022-11-22 01:59:06,974 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:06" (1/1) ... [2022-11-22 01:59:06,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:06" (1/1) ... [2022-11-22 01:59:06,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 01:59:06,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 01:59:06,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 01:59:06,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 01:59:06,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:06" (1/1) ... [2022-11-22 01:59:06,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 01:59:07,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:59:07,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 01:59:07,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 01:59:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 01:59:07,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 01:59:07,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 01:59:07,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-22 01:59:07,174 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 01:59:07,179 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 01:59:07,421 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 01:59:07,427 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 01:59:07,428 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-22 01:59:07,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:59:07 BoogieIcfgContainer [2022-11-22 01:59:07,433 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 01:59:07,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 01:59:07,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 01:59:07,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 01:59:07,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:59:06" (1/3) ... [2022-11-22 01:59:07,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51989dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:59:07, skipping insertion in model container [2022-11-22 01:59:07,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:59:06" (2/3) ... [2022-11-22 01:59:07,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51989dd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:59:07, skipping insertion in model container [2022-11-22 01:59:07,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:59:07" (3/3) ... [2022-11-22 01:59:07,445 INFO L112 eAbstractionObserver]: Analyzing ICFG drift_tenth.c [2022-11-22 01:59:07,479 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 01:59:07,479 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-22 01:59:07,529 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 01:59:07,536 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;@2c374a3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 01:59:07,537 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-22 01:59:07,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:59:07,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 01:59:07,552 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:59:07,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 01:59:07,553 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:59:07,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:59:07,562 INFO L85 PathProgramCache]: Analyzing trace with hash 889605037, now seen corresponding path program 1 times [2022-11-22 01:59:07,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 01:59:07,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350149949] [2022-11-22 01:59:07,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:07,578 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-22 01:59:07,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 01:59:07,581 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/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-22 01:59:07,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/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-22 01:59:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:07,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-22 01:59:07,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:59:07,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:59:07,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-22 01:59:07,732 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 01:59:07,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350149949] [2022-11-22 01:59:07,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350149949] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 01:59:07,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 01:59:07,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 01:59:07,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978346165] [2022-11-22 01:59:07,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 01:59:07,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 01:59:07,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 01:59:07,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 01:59:07,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:59:07,770 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:59:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:59:07,934 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-11-22 01:59:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 01:59:07,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-22 01:59:07,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:59:07,952 INFO L225 Difference]: With dead ends: 22 [2022-11-22 01:59:07,952 INFO L226 Difference]: Without dead ends: 10 [2022-11-22 01:59:07,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 01:59:07,958 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 01:59:07,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 01:59:07,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-11-22 01:59:07,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2022-11-22 01:59:07,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:59:07,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-11-22 01:59:07,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2022-11-22 01:59:07,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:59:07,999 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-11-22 01:59:08,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:59:08,000 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-11-22 01:59:08,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 01:59:08,002 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:59:08,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 01:59:08,012 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/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-22 01:59:08,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/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-22 01:59:08,204 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:59:08,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:59:08,205 INFO L85 PathProgramCache]: Analyzing trace with hash 265180975, now seen corresponding path program 1 times [2022-11-22 01:59:08,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 01:59:08,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108782813] [2022-11-22 01:59:08,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:08,206 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-22 01:59:08,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 01:59:08,208 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/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-22 01:59:08,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/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-22 01:59:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:08,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 01:59:08,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:59:08,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:59:08,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:59:08,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:59:08,361 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 01:59:08,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108782813] [2022-11-22 01:59:08,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108782813] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:59:08,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1119817149] [2022-11-22 01:59:08,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:08,362 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-22 01:59:08,362 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/cvc4 [2022-11-22 01:59:08,365 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-22 01:59:08,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2022-11-22 01:59:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:08,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 01:59:08,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:59:08,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:59:08,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:59:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:59:08,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1119817149] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:59:08,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759203009] [2022-11-22 01:59:08,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 01:59:08,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 01:59:08,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 [2022-11-22 01:59:08,564 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 01:59:08,575 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-22 01:59:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 01:59:08,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-22 01:59:08,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:59:08,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:59:08,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:59:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:59:08,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759203009] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 01:59:08,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-22 01:59:08,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4, 4] total 6 [2022-11-22 01:59:08,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779755714] [2022-11-22 01:59:08,698 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-22 01:59:08,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-22 01:59:08,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 01:59:08,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-22 01:59:08,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-22 01:59:08,701 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:59:09,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 01:59:09,012 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-11-22 01:59:09,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 01:59:09,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-22 01:59:09,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 01:59:09,017 INFO L225 Difference]: With dead ends: 19 [2022-11-22 01:59:09,017 INFO L226 Difference]: Without dead ends: 15 [2022-11-22 01:59:09,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-11-22 01:59:09,020 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 5 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 01:59:09,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 14 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 01:59:09,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-22 01:59:09,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-22 01:59:09,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:59:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-11-22 01:59:09,029 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2022-11-22 01:59:09,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 01:59:09,030 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-11-22 01:59:09,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 01:59:09,030 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-11-22 01:59:09,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-22 01:59:09,031 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 01:59:09,032 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2022-11-22 01:59:09,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-22 01:59:09,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2022-11-22 01:59:09,449 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/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-22 01:59:09,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/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-22 01:59:09,641 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 01:59:09,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 01:59:09,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1745754443, now seen corresponding path program 2 times [2022-11-22 01:59:09,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 01:59:09,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [512889200] [2022-11-22 01:59:09,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-22 01:59:09,643 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-22 01:59:09,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 01:59:09,645 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/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-22 01:59:09,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/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 (6)] Waiting until timeout for monitored process [2022-11-22 01:59:09,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-22 01:59:09,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 01:59:09,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-22 01:59:09,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 01:59:17,486 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 01:59:17,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 01:59:54,622 WARN L859 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-22 02:00:02,585 WARN L837 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-22 02:00:04,606 WARN L859 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-22 02:00:05,535 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-22 02:00:05,536 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:00:05,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [512889200] [2022-11-22 02:00:05,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [512889200] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:00:05,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1271393441] [2022-11-22 02:00:05,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-22 02:00:05,536 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-22 02:00:05,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/cvc4 [2022-11-22 02:00:05,538 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-22 02:00:05,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-11-22 02:00:05,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-22 02:00:05,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:00:05,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-22 02:00:05,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:00:08,406 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:00:08,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:00:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-22 02:00:24,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1271393441] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:00:24,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286696678] [2022-11-22 02:00:24,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-22 02:00:24,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:00:24,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:00:24,998 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:00:24,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-22 02:00:25,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-22 02:00:25,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:00:25,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-22 02:00:25,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:00:35,756 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:00:35,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:00:46,314 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:00:46,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286696678] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:00:46,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-22 02:00:46,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 7, 7] total 25 [2022-11-22 02:00:46,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895850936] [2022-11-22 02:00:46,315 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-22 02:00:46,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-22 02:00:46,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:00:46,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-22 02:00:46,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=418, Unknown=5, NotChecked=86, Total=600 [2022-11-22 02:00:46,318 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:00:48,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-22 02:01:23,527 WARN L233 SmtUtils]: Spent 5.03s on a formula simplification. DAG size of input: 25 DAG size of output: 18 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:02:04,457 WARN L233 SmtUtils]: Spent 12.34s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:02:09,138 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (= (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) .cse2) .cse2) .cse2) .cse2)) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~tick~0#1|)) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|))) is different from true [2022-11-22 02:02:34,700 WARN L233 SmtUtils]: Spent 8.87s on a formula simplification. DAG size of input: 27 DAG size of output: 21 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:02:36,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-22 02:03:02,241 WARN L233 SmtUtils]: Spent 10.20s on a formula simplification. DAG size of input: 25 DAG size of output: 19 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:03:04,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-22 02:03:05,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-22 02:03:25,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-22 02:03:26,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:03:26,550 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-11-22 02:03:26,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-22 02:03:26,551 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-22 02:03:26,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:03:26,551 INFO L225 Difference]: With dead ends: 29 [2022-11-22 02:03:26,551 INFO L226 Difference]: Without dead ends: 25 [2022-11-22 02:03:26,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 199.8s TimeCoverageRelationStatistics Valid=300, Invalid=1027, Unknown=17, NotChecked=216, Total=1560 [2022-11-22 02:03:26,554 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 15 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 18.7s IncrementalHoareTripleChecker+Time [2022-11-22 02:03:26,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 40 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 121 Invalid, 3 Unknown, 32 Unchecked, 18.7s Time] [2022-11-22 02:03:26,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-22 02:03:26,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-22 02:03:26,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:03:26,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-11-22 02:03:26,561 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 14 [2022-11-22 02:03:26,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:03:26,562 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-11-22 02:03:26,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.96) internal successors, (49), 25 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:03:26,562 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-11-22 02:03:26,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-22 02:03:26,563 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:03:26,563 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1] [2022-11-22 02:03:26,590 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-22 02:03:26,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/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 (6)] Forceful destruction successful, exit code 0 [2022-11-22 02:03:26,980 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2022-11-22 02:03:27,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/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,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt [2022-11-22 02:03:27,179 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 02:03:27,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:03:27,179 INFO L85 PathProgramCache]: Analyzing trace with hash 2127216959, now seen corresponding path program 3 times [2022-11-22 02:03:27,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:03:27,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1058328846] [2022-11-22 02:03:27,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:03:27,180 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-22 02:03:27,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:03:27,181 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/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-22 02:03:27,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/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 (9)] Waiting until timeout for monitored process [2022-11-22 02:03:27,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-11-22 02:03:27,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:03:27,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-22 02:03:27,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:04:50,216 WARN L233 SmtUtils]: Spent 6.14s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:05:36,449 WARN L233 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-22 02:05:46,946 WARN L859 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-22 02:05:58,810 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 53 refuted. 11 times theorem prover too weak. 0 trivial. 17 not checked. [2022-11-22 02:05:58,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:06:33,068 WARN L859 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-22 02:07:22,865 WARN L837 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-22 02:07:24,886 WARN L859 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-22 02:07:33,240 WARN L837 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-22 02:07:35,267 WARN L859 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-22 02:07:43,611 WARN L837 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-22 02:07:45,642 WARN L859 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-22 02:07:55,821 WARN L837 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-22 02:08:09,087 WARN L859 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-22 02:08:17,651 WARN L837 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-22 02:08:19,699 WARN L859 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-22 02:08:25,815 WARN L837 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2022-11-22 02:08:27,851 WARN L859 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2022-11-22 02:08:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 2 refuted. 4 times theorem prover too weak. 0 trivial. 75 not checked. [2022-11-22 02:08:27,853 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-22 02:08:27,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1058328846] [2022-11-22 02:08:27,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1058328846] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:08:27,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [952261839] [2022-11-22 02:08:27,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:08:27,853 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-22 02:08:27,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/cvc4 [2022-11-22 02:08:27,856 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-22 02:08:27,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-11-22 02:08:28,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-11-22 02:08:28,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:08:28,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-22 02:08:28,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:09:16,093 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 53 refuted. 11 times theorem prover too weak. 0 trivial. 17 not checked. [2022-11-22 02:09:16,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:10:13,678 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 2 refuted. 4 times theorem prover too weak. 0 trivial. 75 not checked. [2022-11-22 02:10:13,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [952261839] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:10:13,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90246518] [2022-11-22 02:10:13,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-22 02:10:13,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:10:13,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:10:13,682 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:10:13,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-22 02:10:17,408 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-11-22 02:10:17,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:10:17,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-22 02:10:17,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:11:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:11:40,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:13:06,814 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:13:06,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90246518] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:13:06,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-22 02:13:06,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13, 13, 12, 13] total 47 [2022-11-22 02:13:06,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044074610] [2022-11-22 02:13:06,816 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-22 02:13:06,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-22 02:13:06,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-22 02:13:06,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-22 02:13:06,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1157, Unknown=64, NotChecked=720, Total=2162 [2022-11-22 02:13:06,819 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 47 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 47 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:13:08,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-22 02:13:10,590 WARN L859 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-22 02:13:12,652 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~time~0#1| (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-22 02:13:14,721 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~time~0#1| (_ +zero 8 24)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-22 02:13:16,774 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-22 02:13:20,804 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-22 02:13:22,859 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-22 02:13:24,911 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= |c_ULTIMATE.start_main_~time~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2022-11-22 02:13:28,151 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= |c_ULTIMATE.start_main_~time~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (= (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2022-11-22 02:13:30,198 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= |c_ULTIMATE.start_main_~time~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (= (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2022-11-22 02:13:32,251 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-22 02:13:34,292 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= (_ bv2 32) |c_ULTIMATE.start_main_~i~0#1|) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-22 02:13:36,347 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-22 02:13:39,088 WARN L837 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~time~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-22 02:13:41,126 WARN L859 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (_ bv3 32) |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~time~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-22 02:13:43,177 WARN L837 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= |c_ULTIMATE.start_main_~time~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2022-11-22 02:13:45,231 WARN L859 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= |c_ULTIMATE.start_main_~time~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|)) is different from true [2022-11-22 02:13:47,284 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2022-11-22 02:13:49,349 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv4 32) |c_ULTIMATE.start_main_~i~0#1|)) is different from true [2022-11-22 02:13:51,404 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= (_ bv5 32) |c_ULTIMATE.start_main_~i~0#1|) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-22 02:13:53,435 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= (_ bv5 32) |c_ULTIMATE.start_main_~i~0#1|) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-22 02:13:55,482 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (_ bv5 32) |c_ULTIMATE.start_main_~i~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|)) is different from false [2022-11-22 02:13:58,270 WARN L837 $PredicateComparison]: unable to prove that (and (= (_ bv6 32) |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|)) is different from false [2022-11-22 02:14:01,819 WARN L837 $PredicateComparison]: unable to prove that (and (= (_ bv6 32) |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-22 02:14:05,470 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (_ bv7 32) |c_ULTIMATE.start_main_~i~0#1|) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-22 02:14:07,512 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (_ bv7 32) |c_ULTIMATE.start_main_~i~0#1|) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-22 02:14:09,564 WARN L837 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (_ bv7 32) |c_ULTIMATE.start_main_~i~0#1|) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-22 02:14:12,056 WARN L837 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1| |c_ULTIMATE.start_main_~tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~tick~0#1| (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~tick~0#1|) |c_ULTIMATE.start_main_~time~0#1|) (= (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-22 02:14:15,261 WARN L859 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~time~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1|) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= (_ bv8 32) |c_ULTIMATE.start_main_~i~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-22 02:14:17,341 WARN L859 $PredicateComparison]: unable to prove that (and (= (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 1.0) ((_ to_fp 8 24) c_currentRoundingMode 10.0)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (_ +zero 8 24) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)) |c_ULTIMATE.start_main_~time~0#1|) (= (_ bv9 32) |c_ULTIMATE.start_main_~i~0#1|) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~time~0#1|) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-22 02:14:20,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:14:20,897 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-11-22 02:14:20,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-22 02:14:20,900 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 47 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-22 02:14:20,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:14:20,901 INFO L225 Difference]: With dead ends: 31 [2022-11-22 02:14:20,901 INFO L226 Difference]: Without dead ends: 27 [2022-11-22 02:14:20,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 29 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 439.9s TimeCoverageRelationStatistics Valid=273, Invalid=1232, Unknown=93, NotChecked=2958, Total=4556 [2022-11-22 02:14:20,905 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 27 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-22 02:14:20,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 63 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 22 Invalid, 0 Unknown, 63 Unchecked, 3.5s Time] [2022-11-22 02:14:20,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-22 02:14:20,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-22 02:14:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:14:20,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-11-22 02:14:20,913 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2022-11-22 02:14:20,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:14:20,913 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-11-22 02:14:20,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 47 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:14:20,914 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-11-22 02:14:20,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-22 02:14:20,914 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:14:20,915 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2022-11-22 02:14:20,927 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2022-11-22 02:14:21,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/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 (9)] Forceful destruction successful, exit code 0 [2022-11-22 02:14:21,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-22 02:14:21,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/cvc4 --incremental --print-success --lang smt,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/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,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:14:21,522 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-22 02:14:21,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:14:21,522 INFO L85 PathProgramCache]: Analyzing trace with hash -95702975, now seen corresponding path program 4 times [2022-11-22 02:14:21,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-22 02:14:21,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550207324] [2022-11-22 02:14:21,523 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-22 02:14:21,523 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-22 02:14:21,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/mathsat [2022-11-22 02:14:21,525 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/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-22 02:14:21,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b0cb40c-ab16-44b2-b9d8-75e80b875502/bin/utaipan-g80aRyZoba/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 (12)] Waiting until timeout for monitored process [2022-11-22 02:14:21,915 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-22 02:14:21,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-22 02:14:21,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-22 02:14:21,936 INFO L286 TraceCheckSpWp]: Computing forward predicates...