./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI --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 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e --- 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-5e519f3 [2022-11-03 04:06:18,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 04:06:18,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 04:06:18,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 04:06:18,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 04:06:18,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 04:06:18,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 04:06:18,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 04:06:18,136 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 04:06:18,137 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 04:06:18,145 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 04:06:18,146 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 04:06:18,147 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 04:06:18,148 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 04:06:18,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 04:06:18,150 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 04:06:18,155 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 04:06:18,156 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 04:06:18,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 04:06:18,163 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 04:06:18,167 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 04:06:18,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 04:06:18,177 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 04:06:18,178 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 04:06:18,181 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 04:06:18,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 04:06:18,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 04:06:18,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 04:06:18,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 04:06:18,190 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 04:06:18,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 04:06:18,192 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 04:06:18,193 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 04:06:18,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 04:06:18,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 04:06:18,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 04:06:18,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 04:06:18,200 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 04:06:18,200 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 04:06:18,201 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 04:06:18,202 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 04:06:18,203 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 04:06:18,250 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 04:06:18,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 04:06:18,251 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 04:06:18,251 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 04:06:18,252 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 04:06:18,252 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 04:06:18,253 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 04:06:18,253 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 04:06:18,253 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 04:06:18,253 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 04:06:18,255 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 04:06:18,255 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 04:06:18,255 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 04:06:18,255 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 04:06:18,256 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 04:06:18,256 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 04:06:18,256 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 04:06:18,256 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 04:06:18,257 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 04:06:18,258 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 04:06:18,258 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 04:06:18,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 04:06:18,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 04:06:18,258 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 04:06:18,259 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 04:06:18,259 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 04:06:18,259 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 04:06:18,259 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 04:06:18,260 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 04:06:18,260 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 04:06:18,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 04:06:18,261 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 04:06:18,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:06:18,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 04:06:18,261 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 04:06:18,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 04:06:18,262 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 04:06:18,262 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 04:06:18,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 04:06:18,263 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 04:06:18,263 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 04:06:18,263 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_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/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_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI 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 -> 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e [2022-11-03 04:06:18,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 04:06:18,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 04:06:18,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 04:06:18,673 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 04:06:18,674 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 04:06:18,675 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2022-11-03 04:06:18,745 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/data/b7b80a2a2/9282c9ba673d445c8aee2acd08aa895c/FLAG13b080302 [2022-11-03 04:06:19,200 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 04:06:19,201 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2022-11-03 04:06:19,213 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/data/b7b80a2a2/9282c9ba673d445c8aee2acd08aa895c/FLAG13b080302 [2022-11-03 04:06:19,589 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/data/b7b80a2a2/9282c9ba673d445c8aee2acd08aa895c [2022-11-03 04:06:19,592 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 04:06:19,594 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 04:06:19,595 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 04:06:19,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 04:06:19,599 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 04:06:19,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:06:19" (1/1) ... [2022-11-03 04:06:19,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63baff43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:19, skipping insertion in model container [2022-11-03 04:06:19,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:06:19" (1/1) ... [2022-11-03 04:06:19,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 04:06:19,630 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 04:06:19,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2022-11-03 04:06:19,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2022-11-03 04:06:19,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:06:19,850 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 04:06:19,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2022-11-03 04:06:19,870 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2022-11-03 04:06:19,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:06:19,887 INFO L208 MainTranslator]: Completed translation [2022-11-03 04:06:19,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:19 WrapperNode [2022-11-03 04:06:19,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 04:06:19,889 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 04:06:19,889 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 04:06:19,889 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 04:06:19,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:19" (1/1) ... [2022-11-03 04:06:19,905 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:19" (1/1) ... [2022-11-03 04:06:19,923 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 122 [2022-11-03 04:06:19,923 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 04:06:19,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 04:06:19,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 04:06:19,924 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 04:06:19,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:19" (1/1) ... [2022-11-03 04:06:19,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:19" (1/1) ... [2022-11-03 04:06:19,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:19" (1/1) ... [2022-11-03 04:06:19,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:19" (1/1) ... [2022-11-03 04:06:19,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:19" (1/1) ... [2022-11-03 04:06:19,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:19" (1/1) ... [2022-11-03 04:06:19,957 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:19" (1/1) ... [2022-11-03 04:06:19,958 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:19" (1/1) ... [2022-11-03 04:06:19,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 04:06:19,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 04:06:19,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 04:06:19,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 04:06:19,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:19" (1/1) ... [2022-11-03 04:06:19,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:06:19,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:06:19,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 04:06:20,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 04:06:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 04:06:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 04:06:20,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 04:06:20,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 04:06:20,106 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 04:06:20,108 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 04:06:20,297 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 04:06:20,329 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 04:06:20,330 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 04:06:20,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:06:20 BoogieIcfgContainer [2022-11-03 04:06:20,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 04:06:20,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 04:06:20,335 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 04:06:20,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 04:06:20,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:06:19" (1/3) ... [2022-11-03 04:06:20,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770eb61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:06:20, skipping insertion in model container [2022-11-03 04:06:20,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:19" (2/3) ... [2022-11-03 04:06:20,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@770eb61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:06:20, skipping insertion in model container [2022-11-03 04:06:20,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:06:20" (3/3) ... [2022-11-03 04:06:20,342 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c.v+lhb-reducer.c [2022-11-03 04:06:20,361 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 04:06:20,361 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-03 04:06:20,422 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 04:06:20,442 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;@249e4920, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 04:06:20,442 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-03 04:06:20,462 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 26 states have internal predecessors, (40), 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-03 04:06:20,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 04:06:20,469 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:20,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:06:20,471 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:06:20,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:20,480 INFO L85 PathProgramCache]: Analyzing trace with hash -576365883, now seen corresponding path program 1 times [2022-11-03 04:06:20,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:06:20,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485476051] [2022-11-03 04:06:20,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:20,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:06:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:20,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-03 04:06:20,732 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 04:06:20,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485476051] [2022-11-03 04:06:20,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485476051] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:06:20,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:06:20,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 04:06:20,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942468133] [2022-11-03 04:06:20,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:06:20,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 04:06:20,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 04:06:20,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 04:06:20,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:06:20,775 INFO L87 Difference]: Start difference. First operand has 27 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 26 states have internal predecessors, (40), 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 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-03 04:06:20,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:06:20,884 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2022-11-03 04:06:20,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 04:06:20,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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 10 [2022-11-03 04:06:20,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:06:20,895 INFO L225 Difference]: With dead ends: 37 [2022-11-03 04:06:20,895 INFO L226 Difference]: Without dead ends: 29 [2022-11-03 04:06:20,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 04:06:20,902 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 37 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:06:20,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 92 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:06:20,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-03 04:06:20,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-11-03 04:06:20,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 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-03 04:06:20,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-11-03 04:06:20,937 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 10 [2022-11-03 04:06:20,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:06:20,938 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-11-03 04:06:20,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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-03 04:06:20,938 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-11-03 04:06:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 04:06:20,939 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:20,939 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:06:20,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 04:06:20,940 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:06:20,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:20,941 INFO L85 PathProgramCache]: Analyzing trace with hash -508829686, now seen corresponding path program 1 times [2022-11-03 04:06:20,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 04:06:20,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014835879] [2022-11-03 04:06:20,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:20,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 04:06:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 04:06:20,957 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 04:06:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 04:06:20,987 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 04:06:20,988 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 04:06:20,990 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-03 04:06:20,992 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-03 04:06:20,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 04:06:21,008 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1] [2022-11-03 04:06:21,012 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 04:06:21,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 04:06:21 BoogieIcfgContainer [2022-11-03 04:06:21,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 04:06:21,052 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 04:06:21,052 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 04:06:21,052 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 04:06:21,053 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:06:20" (3/4) ... [2022-11-03 04:06:21,056 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-03 04:06:21,056 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 04:06:21,057 INFO L158 Benchmark]: Toolchain (without parser) took 1463.47ms. Allocated memory is still 121.6MB. Free memory was 81.3MB in the beginning and 97.1MB in the end (delta: -15.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 04:06:21,057 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 121.6MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 04:06:21,058 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.64ms. Allocated memory is still 121.6MB. Free memory was 81.1MB in the beginning and 95.0MB in the end (delta: -13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-03 04:06:21,059 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.88ms. Allocated memory is still 121.6MB. Free memory was 95.0MB in the beginning and 93.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 04:06:21,059 INFO L158 Benchmark]: Boogie Preprocessor took 42.20ms. Allocated memory is still 121.6MB. Free memory was 93.4MB in the beginning and 92.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 04:06:21,060 INFO L158 Benchmark]: RCFGBuilder took 365.81ms. Allocated memory is still 121.6MB. Free memory was 92.0MB in the beginning and 78.7MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-03 04:06:21,060 INFO L158 Benchmark]: TraceAbstraction took 716.63ms. Allocated memory is still 121.6MB. Free memory was 78.2MB in the beginning and 97.1MB in the end (delta: -18.9MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. [2022-11-03 04:06:21,061 INFO L158 Benchmark]: Witness Printer took 4.47ms. Allocated memory is still 121.6MB. Free memory was 97.1MB in the beginning and 97.1MB in the end (delta: 2.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 04:06:21,080 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 121.6MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.64ms. Allocated memory is still 121.6MB. Free memory was 81.1MB in the beginning and 95.0MB in the end (delta: -13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.88ms. Allocated memory is still 121.6MB. Free memory was 95.0MB in the beginning and 93.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.20ms. Allocated memory is still 121.6MB. Free memory was 93.4MB in the beginning and 92.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 365.81ms. Allocated memory is still 121.6MB. Free memory was 92.0MB in the beginning and 78.7MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 716.63ms. Allocated memory is still 121.6MB. Free memory was 78.2MB in the beginning and 97.1MB in the end (delta: -18.9MB). Peak memory consumption was 35.9MB. Max. memory is 16.1GB. * Witness Printer took 4.47ms. Allocated memory is still 121.6MB. Free memory was 97.1MB in the beginning and 97.1MB in the end (delta: 2.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 58]: 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 45, overapproximation of to_real at line 41, overapproximation of someBinaryArithmeticDOUBLEoperation at line 173. Possible FailurePath: [L1] int __return_main; [L13] int __tmp_129_0; [L14] int __tmp_129_1; [L15] int __tmp_129_2; [L16] int __return_134; [L19] double main__E0; [L20] double main__E1; [L21] double main__S; [L22] int main__i; [L23] main__E1 = 0 [L24] main__S = 0 [L25] main__i = 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__i=0] [L26] COND TRUE main__i <= 1000000 [L28] main__E0 = __VERIFIER_nondet_double() [L29] int main____CPAchecker_TMP_0; VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__E0=53, main__i=0] [L30] COND TRUE main__E0 >= -1.0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__E0=53, main__i=0] [L32] COND TRUE main__E0 <= 1.0 [L34] main____CPAchecker_TMP_0 = 1 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main__E0=53, main__i=0] [L35] COND TRUE main____CPAchecker_TMP_0 != 0 [L37] int main____CPAchecker_TMP_1; [L38] main____CPAchecker_TMP_1 = __VERIFIER_nondet_int() [L39] COND TRUE !(main____CPAchecker_TMP_1 == 0) [L41] main__S = 0 [L43] main__E1 = main__E0 [L44] int main____CPAchecker_TMP_2; VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=-1, main__E0=53, main__E1=53, main__i=0] [L45] COND FALSE !(main__S >= -10000.0) VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=-1, main__E0=53, main__E1=53, main__i=0] [L162] main____CPAchecker_TMP_2 = 0 VAL [__return_134=0, __return_main=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=-1, main____CPAchecker_TMP_2=0, main__E0=53, main__E1=53, main__i=0] [L52] int __tmp_1; [L53] __tmp_1 = main____CPAchecker_TMP_2 [L54] int __VERIFIER_assert__cond; [L55] __VERIFIER_assert__cond = __tmp_1 VAL [__return_134=0, __return_main=0, __tmp_1=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=-1, main____CPAchecker_TMP_2=0, main__E0=53, main__E1=53, main__i=0] [L56] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_134=0, __return_main=0, __tmp_1=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=-1, main____CPAchecker_TMP_2=0, main__E0=53, main__E1=53, main__i=0] [L58] reach_error() VAL [__return_134=0, __return_main=0, __tmp_1=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=-1, main____CPAchecker_TMP_2=0, main__E0=53, main__E1=53, main__i=0] - UnprovableResult [Line: 104]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 27 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 31 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 17 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-03 04:06:21,149 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI --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 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e --- 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-5e519f3 [2022-11-03 04:06:23,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 04:06:23,613 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 04:06:23,640 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 04:06:23,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 04:06:23,642 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 04:06:23,643 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 04:06:23,645 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 04:06:23,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 04:06:23,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 04:06:23,649 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 04:06:23,650 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 04:06:23,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 04:06:23,652 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 04:06:23,653 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 04:06:23,654 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 04:06:23,655 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 04:06:23,656 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 04:06:23,681 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 04:06:23,683 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 04:06:23,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 04:06:23,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 04:06:23,697 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 04:06:23,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 04:06:23,701 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 04:06:23,702 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 04:06:23,702 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 04:06:23,703 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 04:06:23,704 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 04:06:23,705 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 04:06:23,705 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 04:06:23,706 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 04:06:23,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 04:06:23,707 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 04:06:23,708 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 04:06:23,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 04:06:23,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 04:06:23,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 04:06:23,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 04:06:23,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 04:06:23,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 04:06:23,712 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-03 04:06:23,736 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 04:06:23,736 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 04:06:23,737 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 04:06:23,737 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 04:06:23,738 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 04:06:23,738 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 04:06:23,738 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 04:06:23,739 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 04:06:23,739 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 04:06:23,739 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 04:06:23,739 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 04:06:23,739 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 04:06:23,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 04:06:23,740 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 04:06:23,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 04:06:23,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 04:06:23,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 04:06:23,741 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 04:06:23,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 04:06:23,742 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 04:06:23,742 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 04:06:23,742 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 04:06:23,742 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 04:06:23,743 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 04:06:23,743 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 04:06:23,743 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 04:06:23,743 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 04:06:23,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 04:06:23,744 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 04:06:23,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:06:23,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 04:06:23,744 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 04:06:23,745 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 04:06:23,745 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 04:06:23,745 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 04:06:23,745 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 04:06:23,746 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 04:06:23,746 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 04:06:23,746 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_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/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_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI 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 -> 27e2c506f8c4790ab21ed41c19bd1ea2839907b43d1ff7cacbbc276ad919ab4e [2022-11-03 04:06:24,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 04:06:24,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 04:06:24,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 04:06:24,156 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 04:06:24,158 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 04:06:24,159 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2022-11-03 04:06:24,226 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/data/9590f3ced/84db532f74da4489929fb9abeba348ec/FLAG9cb340566 [2022-11-03 04:06:24,823 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 04:06:24,823 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c [2022-11-03 04:06:24,830 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/data/9590f3ced/84db532f74da4489929fb9abeba348ec/FLAG9cb340566 [2022-11-03 04:06:25,195 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/data/9590f3ced/84db532f74da4489929fb9abeba348ec [2022-11-03 04:06:25,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 04:06:25,205 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 04:06:25,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 04:06:25,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 04:06:25,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 04:06:25,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:06:25" (1/1) ... [2022-11-03 04:06:25,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7982fee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:25, skipping insertion in model container [2022-11-03 04:06:25,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:06:25" (1/1) ... [2022-11-03 04:06:25,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 04:06:25,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 04:06:25,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2022-11-03 04:06:25,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2022-11-03 04:06:25,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:06:25,450 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 04:06:25,468 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[1355,1368] [2022-11-03 04:06:25,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/sv-benchmarks/c/float-benchs/filter1.c.v+lhb-reducer.c[2394,2407] [2022-11-03 04:06:25,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 04:06:25,492 INFO L208 MainTranslator]: Completed translation [2022-11-03 04:06:25,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:25 WrapperNode [2022-11-03 04:06:25,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 04:06:25,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 04:06:25,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 04:06:25,495 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 04:06:25,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:25" (1/1) ... [2022-11-03 04:06:25,512 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:25" (1/1) ... [2022-11-03 04:06:25,533 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2022-11-03 04:06:25,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 04:06:25,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 04:06:25,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 04:06:25,535 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 04:06:25,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:25" (1/1) ... [2022-11-03 04:06:25,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:25" (1/1) ... [2022-11-03 04:06:25,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:25" (1/1) ... [2022-11-03 04:06:25,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:25" (1/1) ... [2022-11-03 04:06:25,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:25" (1/1) ... [2022-11-03 04:06:25,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:25" (1/1) ... [2022-11-03 04:06:25,558 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:25" (1/1) ... [2022-11-03 04:06:25,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:25" (1/1) ... [2022-11-03 04:06:25,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 04:06:25,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 04:06:25,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 04:06:25,564 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 04:06:25,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:25" (1/1) ... [2022-11-03 04:06:25,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 04:06:25,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 04:06:25,608 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 04:06:25,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 04:06:25,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 04:06:25,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 04:06:25,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 04:06:25,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 04:06:25,754 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 04:06:25,757 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 04:06:30,217 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 04:06:30,224 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 04:06:30,224 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 04:06:30,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:06:30 BoogieIcfgContainer [2022-11-03 04:06:30,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 04:06:30,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 04:06:30,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 04:06:30,233 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 04:06:30,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:06:25" (1/3) ... [2022-11-03 04:06:30,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e9a8b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:06:30, skipping insertion in model container [2022-11-03 04:06:30,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:06:25" (2/3) ... [2022-11-03 04:06:30,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e9a8b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:06:30, skipping insertion in model container [2022-11-03 04:06:30,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:06:30" (3/3) ... [2022-11-03 04:06:30,236 INFO L112 eAbstractionObserver]: Analyzing ICFG filter1.c.v+lhb-reducer.c [2022-11-03 04:06:30,251 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 04:06:30,251 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-03 04:06:30,303 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 04:06:30,310 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;@3acc4e7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 04:06:30,311 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-03 04:06:30,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 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-03 04:06:30,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 04:06:30,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:30,323 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:06:30,324 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:06:30,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:30,330 INFO L85 PathProgramCache]: Analyzing trace with hash 775758574, now seen corresponding path program 1 times [2022-11-03 04:06:30,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:06:30,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223218566] [2022-11-03 04:06:30,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:30,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:06:30,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:06:30,349 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:06:30,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 04:06:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:30,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 04:06:30,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:06:30,549 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-03 04:06:30,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:06:30,550 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:06:30,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223218566] [2022-11-03 04:06:30,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223218566] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:06:30,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:06:30,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:06:30,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107056292] [2022-11-03 04:06:30,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:06:30,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:06:30,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:06:30,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:06:30,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:06:30,600 INFO L87 Difference]: Start difference. First operand has 33 states, 30 states have (on average 1.6) internal successors, (48), 32 states have internal predecessors, (48), 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 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-03 04:06:30,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:06:30,742 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. [2022-11-03 04:06:30,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 04:06:30,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-11-03 04:06:30,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:06:30,766 INFO L225 Difference]: With dead ends: 59 [2022-11-03 04:06:30,766 INFO L226 Difference]: Without dead ends: 48 [2022-11-03 04:06:30,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:06:30,776 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 28 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:06:30,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 129 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:06:30,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-03 04:06:30,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2022-11-03 04:06:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 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-03 04:06:30,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-11-03 04:06:30,829 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 13 [2022-11-03 04:06:30,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:06:30,829 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-11-03 04:06:30,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-03 04:06:30,830 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-11-03 04:06:30,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 04:06:30,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:30,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:06:30,850 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-03 04:06:31,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:06:31,046 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:06:31,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:31,048 INFO L85 PathProgramCache]: Analyzing trace with hash 843294771, now seen corresponding path program 1 times [2022-11-03 04:06:31,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:06:31,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175608096] [2022-11-03 04:06:31,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:31,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:06:31,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:06:31,054 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:06:31,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 04:06:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:31,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 04:06:31,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:06:31,182 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-03 04:06:31,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:06:31,183 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:06:31,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175608096] [2022-11-03 04:06:31,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175608096] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:06:31,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:06:31,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:06:31,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260825224] [2022-11-03 04:06:31,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:06:31,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:06:31,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:06:31,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:06:31,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:06:31,187 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-03 04:06:32,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:06:32,839 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2022-11-03 04:06:32,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:06:32,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2022-11-03 04:06:32,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:06:32,842 INFO L225 Difference]: With dead ends: 71 [2022-11-03 04:06:32,842 INFO L226 Difference]: Without dead ends: 51 [2022-11-03 04:06:32,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-03 04:06:32,844 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:06:32,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 40 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-03 04:06:32,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-03 04:06:32,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 38. [2022-11-03 04:06:32,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 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-03 04:06:32,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-11-03 04:06:32,861 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 13 [2022-11-03 04:06:32,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:06:32,861 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-11-03 04:06:32,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-03 04:06:32,862 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-11-03 04:06:32,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-03 04:06:32,862 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:32,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:06:32,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-03 04:06:33,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:06:33,076 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:06:33,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:33,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1349105153, now seen corresponding path program 1 times [2022-11-03 04:06:33,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:06:33,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379697175] [2022-11-03 04:06:33,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:33,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:06:33,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:06:33,087 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:06:33,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 04:06:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:33,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 04:06:33,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:06:34,239 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-03 04:06:34,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:06:34,240 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:06:34,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379697175] [2022-11-03 04:06:34,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [379697175] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:06:34,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:06:34,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 04:06:34,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575352693] [2022-11-03 04:06:34,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:06:34,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 04:06:34,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:06:34,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 04:06:34,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:06:34,242 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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-03 04:06:37,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 04:06:39,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 04:06:39,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:06:39,169 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-11-03 04:06:39,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 04:06:39,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2022-11-03 04:06:39,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:06:39,171 INFO L225 Difference]: With dead ends: 61 [2022-11-03 04:06:39,171 INFO L226 Difference]: Without dead ends: 38 [2022-11-03 04:06:39,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:06:39,173 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-03 04:06:39,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 73 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 2 Unknown, 15 Unchecked, 4.9s Time] [2022-11-03 04:06:39,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-03 04:06:39,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-03 04:06:39,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 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-03 04:06:39,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-11-03 04:06:39,181 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 13 [2022-11-03 04:06:39,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:06:39,181 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-11-03 04:06:39,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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-03 04:06:39,182 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-11-03 04:06:39,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 04:06:39,182 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:39,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:06:39,201 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-03 04:06:39,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:06:39,391 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:06:39,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:39,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1134941057, now seen corresponding path program 1 times [2022-11-03 04:06:39,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:06:39,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964004844] [2022-11-03 04:06:39,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:39,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:06:39,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:06:39,397 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:06:39,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-03 04:06:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:39,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 04:06:39,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:06:40,674 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-03 04:06:40,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:06:40,675 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:06:40,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964004844] [2022-11-03 04:06:40,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964004844] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:06:40,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:06:40,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 04:06:40,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424904306] [2022-11-03 04:06:40,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:06:40,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 04:06:40,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:06:40,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 04:06:40,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:06:40,677 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-03 04:06:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:06:41,183 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2022-11-03 04:06:41,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 04:06:41,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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) Word has length 14 [2022-11-03 04:06:41,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:06:41,232 INFO L225 Difference]: With dead ends: 56 [2022-11-03 04:06:41,232 INFO L226 Difference]: Without dead ends: 33 [2022-11-03 04:06:41,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-11-03 04:06:41,234 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 04:06:41,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 55 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 20 Unchecked, 0.5s Time] [2022-11-03 04:06:41,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-03 04:06:41,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-11-03 04:06:41,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 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-03 04:06:41,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-11-03 04:06:41,240 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 14 [2022-11-03 04:06:41,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:06:41,241 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-11-03 04:06:41,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-03 04:06:41,241 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-11-03 04:06:41,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:06:41,242 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:41,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:06:41,263 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-03 04:06:41,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:06:41,455 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:06:41,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:41,460 INFO L85 PathProgramCache]: Analyzing trace with hash -151896705, now seen corresponding path program 1 times [2022-11-03 04:06:41,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:06:41,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694470789] [2022-11-03 04:06:41,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:41,462 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:06:41,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:06:41,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:06:41,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-03 04:06:41,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:41,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 04:06:41,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:06:41,542 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-03 04:06:41,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:06:41,543 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:06:41,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694470789] [2022-11-03 04:06:41,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1694470789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:06:41,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:06:41,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 04:06:41,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800926256] [2022-11-03 04:06:41,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:06:41,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 04:06:41,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:06:41,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 04:06:41,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 04:06:41,553 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-03 04:06:41,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:06:41,580 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-11-03 04:06:41,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 04:06:41,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-03 04:06:41,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:06:41,582 INFO L225 Difference]: With dead ends: 49 [2022-11-03 04:06:41,582 INFO L226 Difference]: Without dead ends: 29 [2022-11-03 04:06:41,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-03 04:06:41,584 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 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.0s IncrementalHoareTripleChecker+Time [2022-11-03 04:06:41,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 04:06:41,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-03 04:06:41,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-03 04:06:41,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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-03 04:06:41,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-11-03 04:06:41,590 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 24 [2022-11-03 04:06:41,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:06:41,590 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-11-03 04:06:41,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-03 04:06:41,591 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-11-03 04:06:41,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:06:41,591 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:41,592 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:06:41,611 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-03 04:06:41,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:06:41,809 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:06:41,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:41,810 INFO L85 PathProgramCache]: Analyzing trace with hash -327957724, now seen corresponding path program 1 times [2022-11-03 04:06:41,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:06:41,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465151673] [2022-11-03 04:06:41,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:41,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:06:41,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:06:41,812 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:06:41,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-03 04:06:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:41,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 04:06:41,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:06:41,917 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-03 04:06:41,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:06:41,917 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:06:41,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465151673] [2022-11-03 04:06:41,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465151673] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:06:41,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:06:41,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 04:06:41,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504320438] [2022-11-03 04:06:41,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:06:41,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 04:06:41,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:06:41,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 04:06:41,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 04:06:41,920 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-03 04:06:42,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:06:42,060 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-11-03 04:06:42,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 04:06:42,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-03 04:06:42,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:06:42,062 INFO L225 Difference]: With dead ends: 48 [2022-11-03 04:06:42,062 INFO L226 Difference]: Without dead ends: 46 [2022-11-03 04:06:42,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 04:06:42,063 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 23 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:06:42,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 94 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 04:06:42,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-03 04:06:42,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2022-11-03 04:06:42,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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-03 04:06:42,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-11-03 04:06:42,070 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 24 [2022-11-03 04:06:42,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:06:42,071 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-11-03 04:06:42,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-03 04:06:42,071 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-11-03 04:06:42,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:06:42,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:06:42,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:06:42,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-03 04:06:42,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:06:42,273 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:06:42,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:06:42,274 INFO L85 PathProgramCache]: Analyzing trace with hash 401808482, now seen corresponding path program 1 times [2022-11-03 04:06:42,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:06:42,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085988997] [2022-11-03 04:06:42,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:06:42,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:06:42,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:06:42,275 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:06:42,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-03 04:06:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:06:42,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 04:06:42,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:02,458 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-03 04:07:02,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:07:02,459 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:07:02,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085988997] [2022-11-03 04:07:02,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085988997] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:07:02,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:07:02,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 04:07:02,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054740639] [2022-11-03 04:07:02,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:07:02,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 04:07:02,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:07:02,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 04:07:02,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=52, Unknown=1, NotChecked=0, Total=90 [2022-11-03 04:07:02,462 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 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-03 04:07:03,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 04:07:13,619 WARN L234 SmtUtils]: Spent 7.28s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:07:21,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 04:07:23,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 04:07:23,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:07:23,663 INFO L93 Difference]: Finished difference Result 71 states and 80 transitions. [2022-11-03 04:07:23,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 04:07:23,664 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 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-03 04:07:23,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:07:23,665 INFO L225 Difference]: With dead ends: 71 [2022-11-03 04:07:23,665 INFO L226 Difference]: Without dead ends: 52 [2022-11-03 04:07:23,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 24.1s TimeCoverageRelationStatistics Valid=51, Invalid=79, Unknown=2, NotChecked=0, Total=132 [2022-11-03 04:07:23,666 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 43 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 16 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-11-03 04:07:23,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 40 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 49 Invalid, 2 Unknown, 12 Unchecked, 7.2s Time] [2022-11-03 04:07:23,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-03 04:07:23,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2022-11-03 04:07:23,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.125) internal successors, (54), 48 states have internal predecessors, (54), 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-03 04:07:23,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2022-11-03 04:07:23,675 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 24 [2022-11-03 04:07:23,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:07:23,676 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2022-11-03 04:07:23,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 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-03 04:07:23,676 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2022-11-03 04:07:23,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 04:07:23,677 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:07:23,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:07:23,699 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-11-03 04:07:23,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:07:23,891 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:07:23,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:07:23,891 INFO L85 PathProgramCache]: Analyzing trace with hash -60423724, now seen corresponding path program 1 times [2022-11-03 04:07:23,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:07:23,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137045210] [2022-11-03 04:07:23,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:07:23,892 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:07:23,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:07:23,893 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:07:23,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-03 04:07:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:07:25,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-03 04:07:25,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:07:50,059 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse3))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) |ULTIMATE.start_main_~main__E1~0#1|) .cse1)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 04:08:33,564 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from false [2022-11-03 04:08:35,593 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse2 (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from true [2022-11-03 04:09:41,842 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-03 04:09:41,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:09:41,843 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:09:41,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137045210] [2022-11-03 04:09:41,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137045210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:09:41,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:09:41,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 04:09:41,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542749842] [2022-11-03 04:09:41,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:09:41,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 04:09:41,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:09:41,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 04:09:41,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=55, Unknown=3, NotChecked=34, Total=132 [2022-11-03 04:09:41,845 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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-03 04:09:48,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 04:09:50,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 04:09:50,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:09:50,759 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2022-11-03 04:09:50,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 04:09:50,760 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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-03 04:09:50,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:09:50,761 INFO L225 Difference]: With dead ends: 73 [2022-11-03 04:09:50,761 INFO L226 Difference]: Without dead ends: 71 [2022-11-03 04:09:50,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=47, Invalid=68, Unknown=3, NotChecked=38, Total=156 [2022-11-03 04:09:50,762 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 43 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2022-11-03 04:09:50,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 62 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 88 Invalid, 1 Unknown, 103 Unchecked, 8.6s Time] [2022-11-03 04:09:50,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-03 04:09:50,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 58. [2022-11-03 04:09:50,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 57 states have internal predecessors, (65), 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-03 04:09:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2022-11-03 04:09:50,774 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 24 [2022-11-03 04:09:50,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:09:50,775 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2022-11-03 04:09:50,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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-03 04:09:50,775 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-11-03 04:09:50,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 04:09:50,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:09:50,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:09:50,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-03 04:09:50,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:09:50,991 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:09:50,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:09:50,991 INFO L85 PathProgramCache]: Analyzing trace with hash -945685853, now seen corresponding path program 1 times [2022-11-03 04:09:50,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:09:50,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418030660] [2022-11-03 04:09:50,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:09:50,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:09:50,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:09:50,993 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:09:50,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-03 04:09:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:09:51,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 04:09:51,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:10:25,313 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg .cse0)) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)))) is different from false [2022-11-03 04:10:27,322 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.leq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| (fp.neg .cse0)) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0)))) is different from true [2022-11-03 04:10:53,386 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-03 04:10:53,386 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:10:53,386 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:10:53,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418030660] [2022-11-03 04:10:53,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418030660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:10:53,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:10:53,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 04:10:53,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986313789] [2022-11-03 04:10:53,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:10:53,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 04:10:53,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:10:53,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 04:10:53,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=49, Unknown=7, NotChecked=16, Total=110 [2022-11-03 04:10:53,388 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 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-03 04:10:54,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 04:11:03,089 WARN L234 SmtUtils]: Spent 5.93s on a formula simplification. DAG size of input: 25 DAG size of output: 14 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 04:11:09,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 04:11:14,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 04:11:16,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 04:11:18,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 04:11:25,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:11:25,059 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2022-11-03 04:11:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 04:11:25,060 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 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) Word has length 25 [2022-11-03 04:11:25,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:11:25,061 INFO L225 Difference]: With dead ends: 70 [2022-11-03 04:11:25,061 INFO L226 Difference]: Without dead ends: 68 [2022-11-03 04:11:25,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 43.1s TimeCoverageRelationStatistics Valid=69, Invalid=109, Unknown=8, NotChecked=24, Total=210 [2022-11-03 04:11:25,063 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 65 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 23 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-11-03 04:11:25,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 67 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 72 Invalid, 3 Unknown, 68 Unchecked, 9.1s Time] [2022-11-03 04:11:25,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-03 04:11:25,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2022-11-03 04:11:25,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 58 states have internal predecessors, (67), 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-03 04:11:25,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2022-11-03 04:11:25,074 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 25 [2022-11-03 04:11:25,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:11:25,075 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2022-11-03 04:11:25,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 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-03 04:11:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-11-03 04:11:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 04:11:25,085 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:11:25,086 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:11:25,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-03 04:11:25,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:11:25,287 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:11:25,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:11:25,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1904984945, now seen corresponding path program 1 times [2022-11-03 04:11:25,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:11:25,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445458094] [2022-11-03 04:11:25,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:11:25,288 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:11:25,288 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:11:25,289 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:11:25,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-03 04:11:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:11:27,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 04:11:27,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:11:51,091 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse3))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) |ULTIMATE.start_main_~main__E1~0#1|) .cse1)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 04:11:53,139 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse3))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) |ULTIMATE.start_main_~main__E1~0#1|) .cse1)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-11-03 04:12:36,473 WARN L833 $PredicateComparison]: unable to prove that (and (fp.geq |c_ULTIMATE.start_main_~main__S~0#1| (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 (fp.neg .cse3))) (and (= |c_ULTIMATE.start_main_~main__S~0#1| (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)))) (fp.mul c_currentRoundingMode .cse0 (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 .cse1) |ULTIMATE.start_main_~main__E1~0#1|) .cse1)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse2) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 04:13:05,455 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse4 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse5) |ULTIMATE.start_main_~main__E1~0#1|) .cse5)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.geq .cse1 (fp.neg .cse2)) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (not (fp.leq .cse1 .cse2)) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) is different from false [2022-11-03 04:13:07,487 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse3)) (.cse1 (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)))) (fp.mul roundNearestTiesToEven .cse4 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse4 .cse5) |ULTIMATE.start_main_~main__E1~0#1|) .cse5)))) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.geq .cse1 (fp.neg .cse2)) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse3) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (not (fp.leq .cse1 .cse2)) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse3))))) is different from true [2022-11-03 04:14:28,170 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-03 04:14:28,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 04:14:28,170 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 04:14:28,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445458094] [2022-11-03 04:14:28,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445458094] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 04:14:28,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 04:14:28,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 04:14:28,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896586199] [2022-11-03 04:14:28,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 04:14:28,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 04:14:28,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 04:14:28,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 04:14:28,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=55, Unknown=5, NotChecked=54, Total=156 [2022-11-03 04:14:28,172 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 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-03 04:14:34,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-11-03 04:14:35,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 04:14:35,289 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-11-03 04:14:35,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 04:14:35,290 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 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) Word has length 25 [2022-11-03 04:14:35,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 04:14:35,292 INFO L225 Difference]: With dead ends: 76 [2022-11-03 04:14:35,292 INFO L226 Difference]: Without dead ends: 74 [2022-11-03 04:14:35,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=49, Invalid=68, Unknown=5, NotChecked=60, Total=182 [2022-11-03 04:14:35,294 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 37 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 182 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-11-03 04:14:35,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 69 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 93 Invalid, 1 Unknown, 182 Unchecked, 6.8s Time] [2022-11-03 04:14:35,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-03 04:14:35,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 59. [2022-11-03 04:14:35,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 58 states have internal predecessors, (67), 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-03 04:14:35,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2022-11-03 04:14:35,304 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 25 [2022-11-03 04:14:35,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 04:14:35,305 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2022-11-03 04:14:35,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 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-03 04:14:35,305 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-11-03 04:14:35,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-03 04:14:35,306 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 04:14:35,307 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 04:14:35,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-03 04:14:35,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 04:14:35,523 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 04:14:35,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 04:14:35,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1204213622, now seen corresponding path program 1 times [2022-11-03 04:14:35,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 04:14:35,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937896356] [2022-11-03 04:14:35,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 04:14:35,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 04:14:35,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 04:14:35,525 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 04:14:35,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3639ee9-5d47-439f-b8d3-2c314520e843/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-03 04:14:37,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 04:14:37,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-03 04:14:37,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 04:15:09,846 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~main__S~0#1_26| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse2)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.geq |v_ULTIMATE.start_main_~main__S~0#1_26| (fp.neg .cse1)) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.leq |v_ULTIMATE.start_main_~main__S~0#1_26| .cse1) (= (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |v_ULTIMATE.start_main_~main__S~0#1_26|) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) |c_ULTIMATE.start_main_~main__S~0#1|) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse2) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-11-03 04:16:11,674 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~main__S~0#1_26| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1)) (.cse3 (fp.neg .cse2))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (fp.leq |v_ULTIMATE.start_main_~main__S~0#1_26| .cse2) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) |v_ULTIMATE.start_main_~main__S~0#1_26|) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.geq |v_ULTIMATE.start_main_~main__S~0#1_26| .cse3) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from false [2022-11-03 04:16:13,704 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__E1~0#1| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~main__S~0#1_26| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 10000.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.neg .cse1)) (.cse3 (fp.neg .cse2))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~main__E1~0#1| .cse1) (fp.leq |v_ULTIMATE.start_main_~main__S~0#1_26| .cse2) (not (fp.geq (fp.sub roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 999.0 1000.0)) |v_ULTIMATE.start_main_~main__S~0#1_26|) |ULTIMATE.start_main_~main__E0~0#1|) |ULTIMATE.start_main_~main__E1~0#1|) .cse3)) (fp.geq |ULTIMATE.start_main_~main__E1~0#1| .cse0) (fp.geq |v_ULTIMATE.start_main_~main__S~0#1_26| .cse3) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) is different from true [2022-11-03 04:17:46,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-03 04:17:46,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 04:17:52,593 WARN L833 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from false [2022-11-03 04:17:54,646 WARN L855 $PredicateComparison]: unable to prove that (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) is different from true [2022-11-03 04:18:09,051 WARN L833 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from false [2022-11-03 04:18:11,105 WARN L855 $PredicateComparison]: unable to prove that (or (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |c_ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2022-11-03 04:18:25,597 WARN L855 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0))))) is different from true [2022-11-03 04:19:28,826 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (or (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse0))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |c_ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) (fp.neg .cse1)) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse0))))) (not (fp.leq |c_ULTIMATE.start_main_~main__S~0#1| .cse1)))) is different from true [2022-11-03 04:19:43,340 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__S~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse2 (fp.neg .cse0))) (or (not (fp.leq |ULTIMATE.start_main_~main__S~0#1| .cse0)) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse1))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse2) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) (not (fp.geq |ULTIMATE.start_main_~main__S~0#1| .cse2)))))) is different from false [2022-11-03 04:19:45,406 WARN L855 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__S~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse2 (fp.neg .cse0))) (or (not (fp.leq |ULTIMATE.start_main_~main__S~0#1| .cse0)) (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg .cse1))) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |ULTIMATE.start_main_~main__S~0#1|) |ULTIMATE.start_main_~main__E0~0#1|) |c_ULTIMATE.start_main_~main__E1~0#1|) .cse2) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1))))) (not (fp.geq |ULTIMATE.start_main_~main__S~0#1| .cse2)))))) is different from true [2022-11-03 04:20:08,210 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_18| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__S~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 (fp.neg .cse0))) (or (not (fp.leq |ULTIMATE.start_main_~main__S~0#1| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_18| (fp.neg .cse1))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__S~0#1| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_18|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2))))) is different from false [2022-11-03 04:20:10,265 WARN L855 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_18| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__S~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 (fp.neg .cse0))) (or (not (fp.leq |ULTIMATE.start_main_~main__S~0#1| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_18| (fp.neg .cse1))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__S~0#1| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_18|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2))))) is different from true [2022-11-03 04:21:14,766 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_18| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__S~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse2 (fp.neg .cse0))) (or (not (fp.leq |ULTIMATE.start_main_~main__S~0#1| .cse0)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_18| (fp.neg .cse1))) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__S~0#1| .cse2)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_18|) |c_ULTIMATE.start_main_~main__E0~0#1|) .cse2))))) (not (fp.leq |c_ULTIMATE.start_main_~main__E0~0#1| .cse1)))) is different from true [2022-11-03 04:21:37,607 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_18| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__S~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse3 (fp.neg .cse2))) (or (not (fp.leq |ULTIMATE.start_main_~main__S~0#1| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__S~0#1| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_18|) |ULTIMATE.start_main_~main__E0~0#1|) .cse3))))))))) is different from false [2022-11-03 04:21:39,659 WARN L855 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.neg .cse1))) (or (not (fp.geq |ULTIMATE.start_main_~main__E0~0#1| .cse0)) (not (fp.leq |ULTIMATE.start_main_~main__E0~0#1| .cse1)) (forall ((|v_ULTIMATE.start_main_~main__E0~0#1_18| (_ FloatingPoint 11 53)) (|ULTIMATE.start_main_~main__S~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 10000.0))) (let ((.cse3 (fp.neg .cse2))) (or (not (fp.leq |ULTIMATE.start_main_~main__S~0#1| .cse2)) (not (fp.geq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse0)) (not (fp.leq |v_ULTIMATE.start_main_~main__E0~0#1_18| .cse1)) (not (fp.geq |ULTIMATE.start_main_~main__S~0#1| .cse3)) (fp.geq (fp.sub c_currentRoundingMode (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 999.0 1000.0)) |ULTIMATE.start_main_~main__S~0#1|) |v_ULTIMATE.start_main_~main__E0~0#1_18|) |ULTIMATE.start_main_~main__E0~0#1|) .cse3))))))))) is different from true