./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1231_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1231_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 65a8838494b0fa2a560742eb829642f08a5d8cc8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1231_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 65a8838494b0fa2a560742eb829642f08a5d8cc8 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 14:17:22,317 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:17:22,318 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:17:22,327 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:17:22,327 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:17:22,328 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:17:22,329 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:17:22,330 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:17:22,331 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:17:22,331 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:17:22,332 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:17:22,332 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:17:22,333 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:17:22,334 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:17:22,335 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:17:22,335 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:17:22,336 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:17:22,338 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:17:22,339 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:17:22,340 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:17:22,341 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:17:22,342 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:17:22,344 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:17:22,344 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:17:22,344 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:17:22,345 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:17:22,346 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:17:22,346 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:17:22,347 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:17:22,348 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:17:22,348 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:17:22,348 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:17:22,348 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:17:22,349 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:17:22,350 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:17:22,351 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:17:22,351 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 14:17:22,360 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:17:22,360 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:17:22,361 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:17:22,361 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:17:22,361 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 14:17:22,361 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 14:17:22,362 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 14:17:22,362 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 14:17:22,362 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 14:17:22,362 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 14:17:22,362 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 14:17:22,362 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 14:17:22,362 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 14:17:22,363 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:17:22,363 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:17:22,363 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 14:17:22,363 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:17:22,363 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:17:22,363 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:17:22,363 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:17:22,364 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:17:22,364 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:17:22,364 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:17:22,364 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:17:22,364 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:17:22,364 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:17:22,364 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:17:22,364 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:17:22,364 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:17:22,365 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:17:22,365 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:17:22,365 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:17:22,365 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:17:22,365 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 14:17:22,365 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:17:22,365 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 14:17:22,365 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 14:17:22,365 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan 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(__VERIFIER_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 -> 65a8838494b0fa2a560742eb829642f08a5d8cc8 [2018-11-23 14:17:22,387 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:17:22,395 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:17:22,397 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:17:22,398 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:17:22,399 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:17:22,399 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1231_true-unreach-call.c [2018-11-23 14:17:22,443 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/data/2b00cd517/ab2ab87c212b4dd0b01ccbf4525669dc/FLAG6043548bd [2018-11-23 14:17:22,755 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:17:22,755 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/sv-benchmarks/c/float-newlib/float_req_bl_1231_true-unreach-call.c [2018-11-23 14:17:22,759 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/data/2b00cd517/ab2ab87c212b4dd0b01ccbf4525669dc/FLAG6043548bd [2018-11-23 14:17:22,768 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/data/2b00cd517/ab2ab87c212b4dd0b01ccbf4525669dc [2018-11-23 14:17:22,770 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:17:22,771 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:17:22,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:17:22,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:17:22,774 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:17:22,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:17:22" (1/1) ... [2018-11-23 14:17:22,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@325aa0bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:22, skipping insertion in model container [2018-11-23 14:17:22,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:17:22" (1/1) ... [2018-11-23 14:17:22,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:17:22,796 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:17:22,912 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:17:22,914 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:17:22,936 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:17:22,948 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:17:22,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:22 WrapperNode [2018-11-23 14:17:22,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:17:22,949 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:17:22,949 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:17:22,950 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:17:22,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:22" (1/1) ... [2018-11-23 14:17:22,961 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:22" (1/1) ... [2018-11-23 14:17:22,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:17:22,968 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:17:22,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:17:22,968 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:17:22,975 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:22" (1/1) ... [2018-11-23 14:17:22,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:22" (1/1) ... [2018-11-23 14:17:23,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:22" (1/1) ... [2018-11-23 14:17:23,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:22" (1/1) ... [2018-11-23 14:17:23,019 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:22" (1/1) ... [2018-11-23 14:17:23,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:22" (1/1) ... [2018-11-23 14:17:23,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:22" (1/1) ... [2018-11-23 14:17:23,027 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:17:23,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:17:23,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:17:23,028 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:17:23,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:17:23,066 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 14:17:23,066 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 14:17:23,067 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2018-11-23 14:17:23,067 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2018-11-23 14:17:23,067 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2018-11-23 14:17:23,067 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2018-11-23 14:17:23,067 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_float [2018-11-23 14:17:23,067 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_float [2018-11-23 14:17:23,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 14:17:23,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 14:17:23,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 14:17:23,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:17:23,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:17:23,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:17:23,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 14:17:23,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:17:23,297 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:17:23,298 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 14:17:23,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:17:23 BoogieIcfgContainer [2018-11-23 14:17:23,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:17:23,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:17:23,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:17:23,302 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:17:23,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:17:22" (1/3) ... [2018-11-23 14:17:23,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24341cee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:17:23, skipping insertion in model container [2018-11-23 14:17:23,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:22" (2/3) ... [2018-11-23 14:17:23,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24341cee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:17:23, skipping insertion in model container [2018-11-23 14:17:23,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:17:23" (3/3) ... [2018-11-23 14:17:23,305 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231_true-unreach-call.c [2018-11-23 14:17:23,313 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:17:23,320 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-11-23 14:17:23,335 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-11-23 14:17:23,364 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:17:23,365 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 14:17:23,365 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:17:23,365 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:17:23,365 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:17:23,365 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:17:23,365 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:17:23,365 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:17:23,382 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-11-23 14:17:23,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 14:17:23,388 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:23,389 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:23,391 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:23,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:23,396 INFO L82 PathProgramCache]: Analyzing trace with hash -388929614, now seen corresponding path program 1 times [2018-11-23 14:17:23,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:17:23,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:17:23,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:23,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:17:23,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:17:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:23,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 14:17:23,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:17:23,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:17:23,529 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:17:23,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 14:17:23,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 14:17:23,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 14:17:23,542 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2018-11-23 14:17:23,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:23,561 INFO L93 Difference]: Finished difference Result 109 states and 150 transitions. [2018-11-23 14:17:23,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 14:17:23,563 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 36 [2018-11-23 14:17:23,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:23,571 INFO L225 Difference]: With dead ends: 109 [2018-11-23 14:17:23,572 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 14:17:23,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 14:17:23,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 14:17:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-23 14:17:23,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 14:17:23,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2018-11-23 14:17:23,606 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 36 [2018-11-23 14:17:23,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:23,608 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2018-11-23 14:17:23,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 14:17:23,608 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2018-11-23 14:17:23,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 14:17:23,610 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:23,611 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:23,611 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:23,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:23,611 INFO L82 PathProgramCache]: Analyzing trace with hash 689386628, now seen corresponding path program 1 times [2018-11-23 14:17:23,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:17:23,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:17:23,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:23,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:17:23,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:17:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:23,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 14:17:23,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:17:23,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:17:23,680 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:17:23,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:17:23,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:17:23,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:17:23,682 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand 4 states. [2018-11-23 14:17:23,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:23,758 INFO L93 Difference]: Finished difference Result 112 states and 147 transitions. [2018-11-23 14:17:23,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 14:17:23,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-23 14:17:23,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:23,760 INFO L225 Difference]: With dead ends: 112 [2018-11-23 14:17:23,760 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 14:17:23,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:17:23,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 14:17:23,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2018-11-23 14:17:23,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 14:17:23,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2018-11-23 14:17:23,768 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 37 [2018-11-23 14:17:23,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:23,768 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2018-11-23 14:17:23,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:17:23,768 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2018-11-23 14:17:23,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 14:17:23,769 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:23,769 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:23,769 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:23,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:23,770 INFO L82 PathProgramCache]: Analyzing trace with hash 644534487, now seen corresponding path program 1 times [2018-11-23 14:17:23,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:17:23,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:17:23,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:23,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:17:23,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:17:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:23,830 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 14:17:23,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:17:23,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:17:23,831 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:17:23,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:17:23,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:17:23,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:17:23,832 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand 4 states. [2018-11-23 14:17:23,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:23,861 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2018-11-23 14:17:23,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:17:23,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-23 14:17:23,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:23,863 INFO L225 Difference]: With dead ends: 89 [2018-11-23 14:17:23,863 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 14:17:23,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:17:23,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 14:17:23,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-23 14:17:23,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 14:17:23,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2018-11-23 14:17:23,868 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 42 [2018-11-23 14:17:23,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:23,869 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2018-11-23 14:17:23,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:17:23,869 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2018-11-23 14:17:23,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 14:17:23,869 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:23,869 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:23,870 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:23,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:23,870 INFO L82 PathProgramCache]: Analyzing trace with hash 768889016, now seen corresponding path program 1 times [2018-11-23 14:17:23,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:17:23,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:17:23,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:23,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:17:23,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:17:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:23,926 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 14:17:23,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:17:23,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:17:23,927 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:17:23,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:17:23,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:17:23,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:17:23,928 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand 4 states. [2018-11-23 14:17:23,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:23,947 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2018-11-23 14:17:23,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:17:23,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-23 14:17:23,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:23,948 INFO L225 Difference]: With dead ends: 93 [2018-11-23 14:17:23,948 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 14:17:23,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:17:23,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 14:17:23,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2018-11-23 14:17:23,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 14:17:23,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2018-11-23 14:17:23,954 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 45 [2018-11-23 14:17:23,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:23,954 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2018-11-23 14:17:23,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:17:23,954 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2018-11-23 14:17:23,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 14:17:23,955 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:23,955 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:23,955 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:23,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:23,956 INFO L82 PathProgramCache]: Analyzing trace with hash 258354839, now seen corresponding path program 1 times [2018-11-23 14:17:23,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:17:23,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:17:23,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:23,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:17:23,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:17:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:23,986 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 14:17:23,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:17:23,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 14:17:23,986 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 14:17:23,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 14:17:23,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 14:17:23,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:17:23,987 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand 3 states. [2018-11-23 14:17:24,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:24,003 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2018-11-23 14:17:24,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 14:17:24,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-23 14:17:24,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:24,005 INFO L225 Difference]: With dead ends: 70 [2018-11-23 14:17:24,005 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 14:17:24,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 14:17:24,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 14:17:24,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-23 14:17:24,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 14:17:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 88 transitions. [2018-11-23 14:17:24,012 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 88 transitions. Word has length 45 [2018-11-23 14:17:24,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:24,012 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 88 transitions. [2018-11-23 14:17:24,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 14:17:24,012 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2018-11-23 14:17:24,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 14:17:24,014 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:24,014 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:24,014 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:24,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:24,014 INFO L82 PathProgramCache]: Analyzing trace with hash -2126980749, now seen corresponding path program 1 times [2018-11-23 14:17:24,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 14:17:24,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:17:24,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:24,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 14:17:24,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 14:17:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:17:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 14:17:24,074 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=2139095048, |#NULL.offset|=2139095042, |old(#NULL.base)|=2139095048, |old(#NULL.offset)|=2139095042] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=2139095048, |old(#NULL.offset)|=2139095042] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=2139095048, |old(#NULL.offset)|=2139095042] [?] RET #134#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret23 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := #t~nondet7;havoc #t~nondet7;~y~0 := #t~nondet8;havoc #t~nondet8; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret9 := isnan_float(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095044.0] [?] ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095044.0, |isnan_float_#res|=1] [?] assume true; VAL [isnan_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095044.0, |isnan_float_#res|=1] [?] RET #138#return; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret9|=1] [?] assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;#t~short11 := 0 != #t~ret9; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret9|=1, |main_#t~short11|=true] [?] assume #t~short11; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret9|=1, |main_#t~short11|=true] [?] CALL call #t~ret10 := isnan_float(~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095043.0] [?] ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_float_~x=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095043.0, |isnan_float_#res|=0] [?] assume true; VAL [isnan_float_~x=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095043.0, |isnan_float_#res|=0] [?] RET #140#return; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret10|=0, |main_#t~ret9|=1, |main_#t~short11|=true] [?] assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;#t~short11 := 0 == #t~ret10; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret10|=0, |main_#t~ret9|=1, |main_#t~short11|=true] [?] #t~short15 := #t~short11; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret10|=0, |main_#t~ret9|=1, |main_#t~short11|=true, |main_#t~short15|=true] [?] assume #t~short15; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret10|=0, |main_#t~ret9|=1, |main_#t~short11|=true, |main_#t~short15|=true] [?] assume #t~short15;havoc #t~ret10;havoc #t~short11;havoc #t~short14;havoc #t~ret9;havoc #t~ret12;havoc #t~ret13;havoc #t~short15; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |fmin_float_#in~x|=2139095044.0, |fmin_float_#in~y|=2139095043.0] [?] ~x := #in~x;~y := #in~y; VAL [fmin_float_~x=2139095044.0, fmin_float_~y=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_float_#in~x|=2139095044.0, |fmin_float_#in~y|=2139095043.0] [?] CALL call #t~ret2 := __fpclassify_float(~x); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0] [?] ~x := #in~x;havoc ~w~0; VAL [__fpclassify_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0] [?] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem0;call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~mem0;havoc #t~union1;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0] [?] goto; VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0] [?] assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0] [?] assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0] [?] assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0] [?] assume !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296);#res := 0; VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0, |__fpclassify_float_#res|=0] [?] assume true; VAL [__fpclassify_float_~w~0=2139095041, __fpclassify_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_float_#in~x|=2139095044.0, |__fpclassify_float_#res|=0] [?] RET #130#return; VAL [fmin_float_~x=2139095044.0, fmin_float_~y=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_float_#in~x|=2139095044.0, |fmin_float_#in~y|=2139095043.0, |fmin_float_#t~ret2|=0] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fmin_float_~x=2139095044.0, fmin_float_~y=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_float_#in~x|=2139095044.0, |fmin_float_#in~y|=2139095043.0, |fmin_float_#t~ret2|=0] [?] assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; VAL [fmin_float_~x=2139095044.0, fmin_float_~y=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_float_#in~x|=2139095044.0, |fmin_float_#in~y|=2139095043.0, |fmin_float_#res|=2139095043.0] [?] assume true; VAL [fmin_float_~x=2139095044.0, fmin_float_~y=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_float_#in~x|=2139095044.0, |fmin_float_#in~y|=2139095043.0, |fmin_float_#res|=2139095043.0] [?] RET #146#return; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret16|=2139095043.0] [?] ~res~0 := #t~ret16;havoc #t~ret16; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret17 := isnan_float(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095044.0] [?] ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095044.0, |isnan_float_#res|=1] [?] assume true; VAL [isnan_float_~x=2139095044.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095044.0, |isnan_float_#res|=1] [?] RET #148#return; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret17|=1] [?] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647;#t~short19 := 0 != #t~ret17; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret17|=1, |main_#t~short19|=true] [?] assume #t~short19; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret17|=1, |main_#t~short19|=true] [?] CALL call #t~ret18 := isnan_float(~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095043.0] [?] ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [isnan_float_~x=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095043.0, |isnan_float_#res|=0] [?] assume true; VAL [isnan_float_~x=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |isnan_float_#in~x|=2139095043.0, |isnan_float_#res|=0] [?] RET #150#return; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret17|=1, |main_#t~ret18|=0, |main_#t~short19|=true] [?] assume -2147483648 <= #t~ret18 && #t~ret18 <= 2147483647;#t~short19 := 0 == #t~ret18; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret17|=1, |main_#t~ret18|=0, |main_#t~short19|=true] [?] assume #t~short19 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0);havoc #t~ret17;havoc #t~short19;havoc #t~ret18; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2139095048, #NULL.offset=2139095042, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret23 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L66] ~x~0 := #t~nondet7; [L66] havoc #t~nondet7; [L67] ~y~0 := #t~nondet8; [L67] havoc #t~nondet8; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] CALL call #t~ret9 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L57] ensures true; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L68] RET call #t~ret9 := isnan_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=1, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; [L68] #t~short11 := 0 != #t~ret9; VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume #t~short11; VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] CALL call #t~ret10 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L57] ensures true; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L68] RET call #t~ret10 := isnan_float(~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; [L68] #t~short11 := 0 == #t~ret10; VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] #t~short15 := #t~short11; VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, #t~short15=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] assume #t~short15; VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, #t~short15=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L84] assume #t~short15; [L68] havoc #t~ret10; [L68] havoc #t~short11; [L69] havoc #t~short14; [L68] havoc #t~ret9; [L69] havoc #t~ret12; [L69] havoc #t~ret13; [L68-L69] havoc #t~short15; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L71] CALL call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L35-L42] ~x := #in~x; [L35-L42] ~y := #in~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0] [L12-L33] ~x := #in~x; [L13] havoc ~w~0; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095044E9] [L16] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L17] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L18] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L18] ~w~0 := #t~mem0; [L18] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L18] havoc #t~mem0; [L18] havoc #t~union1; [L16] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L16] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L21-L32] assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L23-L32] assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L26-L32] assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L29-L32] assume !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296); [L32] #res := 0; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L12-L33] ensures true; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L36] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36-L37] assume 0 == #t~ret2; [L36] havoc #t~ret2; [L37] #res := ~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=2.139095043E9, ~x=2.139095044E9, ~y=2.139095043E9] [L35-L42] ensures true; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=2.139095043E9, ~x=2.139095044E9, ~y=2.139095043E9] [L71] RET call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret16=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L71] ~res~0 := #t~ret16; [L71] havoc #t~ret16; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] CALL call #t~ret17 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L57] ensures true; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L74] RET call #t~ret17 := isnan_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=1, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; [L74] #t~short19 := 0 != #t~ret17; VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=1, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume #t~short19; VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=1, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] CALL call #t~ret18 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L57] ensures true; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L74] RET call #t~ret18 := isnan_float(~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=1, #t~ret18=0, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume -2147483648 <= #t~ret18 && #t~ret18 <= 2147483647; [L74] #t~short19 := 0 == #t~ret18; VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=1, #t~ret18=0, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74-L77] assume #t~short19 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0); [L74] havoc #t~ret17; [L74] havoc #t~short19; [L74] havoc #t~ret18; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L75] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=2139095048, #NULL.offset=2139095042, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=2139095048, old(#NULL.offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret23 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L66] ~x~0 := #t~nondet7; [L66] havoc #t~nondet7; [L67] ~y~0 := #t~nondet8; [L67] havoc #t~nondet8; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] CALL call #t~ret9 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L57] ensures true; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L68] RET call #t~ret9 := isnan_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=1, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; [L68] #t~short11 := 0 != #t~ret9; VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume #t~short11; VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] CALL call #t~ret10 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L57] ensures true; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L68] RET call #t~ret10 := isnan_float(~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; [L68] #t~short11 := 0 == #t~ret10; VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] #t~short15 := #t~short11; VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, #t~short15=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] assume #t~short15; VAL [#NULL.base=0, #NULL.offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, #t~short15=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L84] assume #t~short15; [L68] havoc #t~ret10; [L68] havoc #t~short11; [L69] havoc #t~short14; [L68] havoc #t~ret9; [L69] havoc #t~ret12; [L69] havoc #t~ret13; [L68-L69] havoc #t~short15; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L71] CALL call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L35-L42] ~x := #in~x; [L35-L42] ~y := #in~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0] [L12-L33] ~x := #in~x; [L13] havoc ~w~0; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095044E9] [L16] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L17] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L18] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L18] ~w~0 := #t~mem0; [L18] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L18] havoc #t~mem0; [L18] havoc #t~union1; [L16] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L16] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L21-L32] assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L23-L32] assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L26-L32] assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L29-L32] assume !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296); [L32] #res := 0; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L12-L33] ensures true; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L36] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36-L37] assume 0 == #t~ret2; [L36] havoc #t~ret2; [L37] #res := ~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=2.139095043E9, ~x=2.139095044E9, ~y=2.139095043E9] [L35-L42] ensures true; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=2.139095043E9, ~x=2.139095044E9, ~y=2.139095043E9] [L71] RET call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret16=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L71] ~res~0 := #t~ret16; [L71] havoc #t~ret16; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] CALL call #t~ret17 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L57] ensures true; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L74] RET call #t~ret17 := isnan_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=1, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; [L74] #t~short19 := 0 != #t~ret17; VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=1, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume #t~short19; VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=1, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] CALL call #t~ret18 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L57] ensures true; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L74] RET call #t~ret18 := isnan_float(~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=1, #t~ret18=0, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume -2147483648 <= #t~ret18 && #t~ret18 <= 2147483647; [L74] #t~short19 := 0 == #t~ret18; VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=1, #t~ret18=0, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74-L77] assume #t~short19 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0); [L74] havoc #t~ret17; [L74] havoc #t~short19; [L74] havoc #t~ret18; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L75] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2139095048, #NULL!offset=2139095042, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret23 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L66] ~x~0 := #t~nondet7; [L66] havoc #t~nondet7; [L67] ~y~0 := #t~nondet8; [L67] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] CALL call #t~ret9 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=1, ~x=2.139095044E9] [L68] RET call #t~ret9 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=1, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; [L68] #t~short11 := 0 != #t~ret9; VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] COND TRUE #t~short11 VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] CALL call #t~ret10 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095043E9] [L68] RET call #t~ret10 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; [L68] #t~short11 := 0 == #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] #t~short15 := #t~short11; VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, #t~short15=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] COND TRUE #t~short15 VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, #t~short15=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] COND TRUE #t~short15 [L68] havoc #t~ret10; [L68] havoc #t~short11; [L69] havoc #t~short14; [L68] havoc #t~ret9; [L69] havoc #t~ret12; [L69] havoc #t~ret13; [L68-L69] havoc #t~short15; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L71] CALL call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L35-L42] ~x := #in~x; [L35-L42] ~y := #in~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L12-L33] ~x := #in~x; [L13] havoc ~w~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9] [L16] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L17] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L18] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L18] ~w~0 := #t~mem0; [L18] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L18] havoc #t~mem0; [L18] havoc #t~union1; [L16] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L16] havoc ~#gf_u~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L21] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L23-L24] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L26-L27] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L29] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L32] #res := 0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L36] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] COND TRUE 0 == #t~ret2 [L36] havoc #t~ret2; [L37] #res := ~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=2.139095043E9, ~x=2.139095044E9, ~y=2.139095043E9] [L71] RET call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L71] ~res~0 := #t~ret16; [L71] havoc #t~ret16; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] CALL call #t~ret17 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=1, ~x=2.139095044E9] [L74] RET call #t~ret17 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; [L74] #t~short19 := 0 != #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] COND TRUE #t~short19 VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] CALL call #t~ret18 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095043E9] [L74] RET call #t~ret18 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~ret18=0, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume -2147483648 <= #t~ret18 && #t~ret18 <= 2147483647; [L74] #t~short19 := 0 == #t~ret18; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~ret18=0, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] COND TRUE #t~short19 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0) [L74] havoc #t~ret17; [L74] havoc #t~short19; [L74] havoc #t~ret18; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L75] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2139095048, #NULL!offset=2139095042, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret23 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L66] ~x~0 := #t~nondet7; [L66] havoc #t~nondet7; [L67] ~y~0 := #t~nondet8; [L67] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] CALL call #t~ret9 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=1, ~x=2.139095044E9] [L68] RET call #t~ret9 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=1, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; [L68] #t~short11 := 0 != #t~ret9; VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] COND TRUE #t~short11 VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] CALL call #t~ret10 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095043E9] [L68] RET call #t~ret10 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; [L68] #t~short11 := 0 == #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] #t~short15 := #t~short11; VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, #t~short15=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] COND TRUE #t~short15 VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, #t~short15=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] COND TRUE #t~short15 [L68] havoc #t~ret10; [L68] havoc #t~short11; [L69] havoc #t~short14; [L68] havoc #t~ret9; [L69] havoc #t~ret12; [L69] havoc #t~ret13; [L68-L69] havoc #t~short15; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L71] CALL call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L35-L42] ~x := #in~x; [L35-L42] ~y := #in~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L12-L33] ~x := #in~x; [L13] havoc ~w~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9] [L16] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L17] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L18] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L18] ~w~0 := #t~mem0; [L18] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L18] havoc #t~mem0; [L18] havoc #t~union1; [L16] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L16] havoc ~#gf_u~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L21] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L23-L24] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L26-L27] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L29] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L32] #res := 0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L36] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] COND TRUE 0 == #t~ret2 [L36] havoc #t~ret2; [L37] #res := ~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=2.139095043E9, ~x=2.139095044E9, ~y=2.139095043E9] [L71] RET call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L71] ~res~0 := #t~ret16; [L71] havoc #t~ret16; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] CALL call #t~ret17 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=1, ~x=2.139095044E9] [L74] RET call #t~ret17 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; [L74] #t~short19 := 0 != #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] COND TRUE #t~short19 VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] CALL call #t~ret18 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095043E9] [L74] RET call #t~ret18 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~ret18=0, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume -2147483648 <= #t~ret18 && #t~ret18 <= 2147483647; [L74] #t~short19 := 0 == #t~ret18; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~ret18=0, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] COND TRUE #t~short19 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0) [L74] havoc #t~ret17; [L74] havoc #t~short19; [L74] havoc #t~ret18; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L75] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2139095048, #NULL!offset=2139095042, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret23 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L66] ~x~0 := #t~nondet7; [L66] havoc #t~nondet7; [L67] ~y~0 := #t~nondet8; [L67] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] CALL call #t~ret9 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=1, ~x=2.139095044E9] [L68] RET call #t~ret9 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=1, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; [L68] #t~short11 := 0 != #t~ret9; VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] COND TRUE #t~short11 VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] CALL call #t~ret10 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095043E9] [L68] RET call #t~ret10 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; [L68] #t~short11 := 0 == #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] #t~short15 := #t~short11; VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, #t~short15=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] COND TRUE #t~short15 VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, #t~short15=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] COND TRUE #t~short15 [L68] havoc #t~ret10; [L68] havoc #t~short11; [L69] havoc #t~short14; [L68] havoc #t~ret9; [L69] havoc #t~ret12; [L69] havoc #t~ret13; [L68-L69] havoc #t~short15; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L71] CALL call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L35-L42] ~x := #in~x; [L35-L42] ~y := #in~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L12-L33] ~x := #in~x; [L13] havoc ~w~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9] [L16] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L17] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L18] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L18] ~w~0 := #t~mem0; [L18] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L18] havoc #t~mem0; [L18] havoc #t~union1; [L16] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L16] havoc ~#gf_u~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L21] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L23-L24] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L26-L27] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L29] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L32] #res := 0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L36] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] COND TRUE 0 == #t~ret2 [L36] havoc #t~ret2; [L37] #res := ~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=2.139095043E9, ~x=2.139095044E9, ~y=2.139095043E9] [L71] RET call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L71] ~res~0 := #t~ret16; [L71] havoc #t~ret16; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] CALL call #t~ret17 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=1, ~x=2.139095044E9] [L74] RET call #t~ret17 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; [L74] #t~short19 := 0 != #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] COND TRUE #t~short19 VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] CALL call #t~ret18 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095043E9] [L74] RET call #t~ret18 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~ret18=0, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume -2147483648 <= #t~ret18 && #t~ret18 <= 2147483647; [L74] #t~short19 := 0 == #t~ret18; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~ret18=0, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] COND TRUE #t~short19 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0) [L74] havoc #t~ret17; [L74] havoc #t~short19; [L74] havoc #t~ret18; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L75] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=2139095048, #NULL!offset=2139095042, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=2139095048, old(#NULL!offset)=2139095042] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret23 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L66] ~x~0 := #t~nondet7; [L66] havoc #t~nondet7; [L67] ~y~0 := #t~nondet8; [L67] havoc #t~nondet8; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] CALL call #t~ret9 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=1, ~x=2.139095044E9] [L68] RET call #t~ret9 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=1, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647; [L68] #t~short11 := 0 != #t~ret9; VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] COND TRUE #t~short11 VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] CALL call #t~ret10 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095043E9] [L68] RET call #t~ret10 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68] assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647; [L68] #t~short11 := 0 == #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] #t~short15 := #t~short11; VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, #t~short15=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] COND TRUE #t~short15 VAL [#NULL!base=0, #NULL!offset=0, #t~ret10=0, #t~ret9=1, #t~short11=true, #t~short15=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L68-L69] COND TRUE #t~short15 [L68] havoc #t~ret10; [L68] havoc #t~short11; [L69] havoc #t~short14; [L68] havoc #t~ret9; [L69] havoc #t~ret12; [L69] havoc #t~ret13; [L68-L69] havoc #t~short15; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L71] CALL call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L35-L42] ~x := #in~x; [L35-L42] ~y := #in~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L12-L33] ~x := #in~x; [L13] havoc ~w~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9] [L16] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L17] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L18] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L18] ~w~0 := #t~mem0; [L18] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L18] havoc #t~mem0; [L18] havoc #t~union1; [L16] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L16] havoc ~#gf_u~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L21] COND FALSE !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L23-L24] COND FALSE !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L26-L27] COND FALSE !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)) VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L29] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L32] #res := 0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L36] RET call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #t~ret2=0, ~x=2.139095044E9, ~y=2.139095043E9] [L36] COND TRUE 0 == #t~ret2 [L36] havoc #t~ret2; [L37] #res := ~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=2.139095043E9, ~x=2.139095044E9, ~y=2.139095043E9] [L71] RET call #t~ret16 := fmin_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret16=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L71] ~res~0 := #t~ret16; [L71] havoc #t~ret16; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] CALL call #t~ret17 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=1, ~x=2.139095044E9] [L74] RET call #t~ret17 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; [L74] #t~short19 := 0 != #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] COND TRUE #t~short19 VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] CALL call #t~ret18 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L57] ~x := #in~x; [L57] #res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0, #res=0, ~x=2.139095043E9] [L74] RET call #t~ret18 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~ret18=0, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assume -2147483648 <= #t~ret18 && #t~ret18 <= 2147483647; [L74] #t~short19 := 0 == #t~ret18; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=1, #t~ret18=0, #t~short19=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] COND TRUE #t~short19 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0) [L74] havoc #t~ret17; [L74] havoc #t~short19; [L74] havoc #t~ret18; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L75] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L66] float x = __VERIFIER_nondet_float(); [L67] float y = __VERIFIER_nondet_float(); [L68] CALL, EXPR isnan_float(x) VAL [\old(x)=2139095044] [L57] return x != x; VAL [\old(x)=2139095044, \result=1, x=2139095044] [L68] RET, EXPR isnan_float(x) VAL [isnan_float(x)=1, x=2139095044, y=2139095043] [L68] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, x=2139095044, y=2139095043] [L68] CALL, EXPR isnan_float(y) VAL [\old(x)=2139095043] [L57] return x != x; VAL [\old(x)=2139095043, \result=0, x=2139095043] [L68] RET, EXPR isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=2139095044, y=2139095043] [L68] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=2139095044, y=2139095043] [L68-L69] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) VAL [(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))=1, isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=2139095044, y=2139095043] [L68-L69] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L71] CALL, EXPR fmin_float(x, y) VAL [\old(x)=2139095044, \old(y)=2139095043] [L36] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=2139095044] [L13] __uint32_t w; VAL [\old(x)=2139095044, x=2139095044] [L16] ieee_float_shape_type gf_u; [L17] gf_u.value = (x) [L18] EXPR gf_u.word [L18] (w) = gf_u.word [L21] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L23-L24] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L26-L27] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L29] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L32] return 0; VAL [\old(x)=2139095044, \result=0, w=2139095041, x=2139095044] [L36] RET, EXPR __fpclassify_float(x) VAL [\old(x)=2139095044, \old(y)=2139095043, __fpclassify_float(x)=0, x=2139095044, y=2139095043] [L36] COND TRUE __fpclassify_float(x) == 0 [L37] return y; VAL [\old(x)=2139095044, \old(y)=2139095043, \result=2139095043, x=2139095044, y=2139095043] [L71] RET, EXPR fmin_float(x, y) VAL [fmin_float(x, y)=2139095043, x=2139095044, y=2139095043] [L71] float res = fmin_float(x, y); [L74] CALL, EXPR isnan_float(x) VAL [\old(x)=2139095044] [L57] return x != x; VAL [\old(x)=2139095044, \result=1, x=2139095044] [L74] RET, EXPR isnan_float(x) VAL [isnan_float(x)=1, res=2139095043, x=2139095044, y=2139095043] [L74] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, res=2139095043, x=2139095044, y=2139095043] [L74] CALL, EXPR isnan_float(y) VAL [\old(x)=2139095043] [L57] return x != x; VAL [\old(x)=2139095043, \result=0, x=2139095043] [L74] RET, EXPR isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, res=2139095043, x=2139095044, y=2139095043] [L74] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, res=2139095043, x=2139095044, y=2139095043] [L74] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L75] __VERIFIER_error() VAL [res=2139095043, x=2139095044, y=2139095043] ----- [2018-11-23 14:17:24,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:17:24 BoogieIcfgContainer [2018-11-23 14:17:24,126 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 14:17:24,126 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:17:24,127 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:17:24,127 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:17:24,127 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:17:23" (3/4) ... [2018-11-23 14:17:24,130 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 14:17:24,131 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:17:24,131 INFO L168 Benchmark]: Toolchain (without parser) took 1360.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 959.1 MB in the beginning and 998.4 MB in the end (delta: -39.3 MB). Peak memory consumption was 82.9 MB. Max. memory is 11.5 GB. [2018-11-23 14:17:24,133 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:17:24,133 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.78 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 14:17:24,133 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.37 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:17:24,134 INFO L168 Benchmark]: Boogie Preprocessor took 59.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -170.2 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. [2018-11-23 14:17:24,134 INFO L168 Benchmark]: RCFGBuilder took 270.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:17:24,135 INFO L168 Benchmark]: TraceAbstraction took 827.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.4 MB in the end (delta: 94.7 MB). Peak memory consumption was 94.7 MB. Max. memory is 11.5 GB. [2018-11-23 14:17:24,135 INFO L168 Benchmark]: Witness Printer took 4.29 ms. Allocated memory is still 1.2 GB. Free memory is still 998.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:17:24,138 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 177.78 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.37 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -170.2 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 270.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 827.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.4 MB in the end (delta: 94.7 MB). Peak memory consumption was 94.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.29 ms. Allocated memory is still 1.2 GB. Free memory is still 998.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 75]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 74. Possible FailurePath: [L66] float x = __VERIFIER_nondet_float(); [L67] float y = __VERIFIER_nondet_float(); [L68] CALL, EXPR isnan_float(x) VAL [\old(x)=2139095044] [L57] return x != x; VAL [\old(x)=2139095044, \result=1, x=2139095044] [L68] RET, EXPR isnan_float(x) VAL [isnan_float(x)=1, x=2139095044, y=2139095043] [L68] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, x=2139095044, y=2139095043] [L68] CALL, EXPR isnan_float(y) VAL [\old(x)=2139095043] [L57] return x != x; VAL [\old(x)=2139095043, \result=0, x=2139095043] [L68] RET, EXPR isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=2139095044, y=2139095043] [L68] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=2139095044, y=2139095043] [L68-L69] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) VAL [(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))=1, isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, x=2139095044, y=2139095043] [L68-L69] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L71] CALL, EXPR fmin_float(x, y) VAL [\old(x)=2139095044, \old(y)=2139095043] [L36] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=2139095044] [L13] __uint32_t w; VAL [\old(x)=2139095044, x=2139095044] [L16] ieee_float_shape_type gf_u; [L17] gf_u.value = (x) [L18] EXPR gf_u.word [L18] (w) = gf_u.word [L21] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L23-L24] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L26-L27] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L29] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L32] return 0; VAL [\old(x)=2139095044, \result=0, w=2139095041, x=2139095044] [L36] RET, EXPR __fpclassify_float(x) VAL [\old(x)=2139095044, \old(y)=2139095043, __fpclassify_float(x)=0, x=2139095044, y=2139095043] [L36] COND TRUE __fpclassify_float(x) == 0 [L37] return y; VAL [\old(x)=2139095044, \old(y)=2139095043, \result=2139095043, x=2139095044, y=2139095043] [L71] RET, EXPR fmin_float(x, y) VAL [fmin_float(x, y)=2139095043, x=2139095044, y=2139095043] [L71] float res = fmin_float(x, y); [L74] CALL, EXPR isnan_float(x) VAL [\old(x)=2139095044] [L57] return x != x; VAL [\old(x)=2139095044, \result=1, x=2139095044] [L74] RET, EXPR isnan_float(x) VAL [isnan_float(x)=1, res=2139095043, x=2139095044, y=2139095043] [L74] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, res=2139095043, x=2139095044, y=2139095043] [L74] CALL, EXPR isnan_float(y) VAL [\old(x)=2139095043] [L57] return x != x; VAL [\old(x)=2139095043, \result=0, x=2139095043] [L74] RET, EXPR isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, res=2139095043, x=2139095044, y=2139095043] [L74] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, isnan_float(y)=0, res=2139095043, x=2139095044, y=2139095043] [L74] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L75] __VERIFIER_error() VAL [res=2139095043, x=2139095044, y=2139095043] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 66 locations, 2 error locations. UNSAFE Result, 0.7s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 407 SDtfs, 16 SDslu, 523 SDs, 0 SdLazy, 40 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 8870 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 33/33 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 14:17:25,598 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 14:17:25,599 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 14:17:25,607 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 14:17:25,607 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 14:17:25,608 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 14:17:25,608 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 14:17:25,610 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 14:17:25,611 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 14:17:25,611 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 14:17:25,612 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 14:17:25,612 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 14:17:25,613 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 14:17:25,613 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 14:17:25,614 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 14:17:25,615 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 14:17:25,615 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 14:17:25,617 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 14:17:25,618 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 14:17:25,619 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 14:17:25,620 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 14:17:25,621 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 14:17:25,622 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 14:17:25,623 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 14:17:25,623 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 14:17:25,623 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 14:17:25,624 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 14:17:25,625 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 14:17:25,625 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 14:17:25,626 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 14:17:25,626 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 14:17:25,626 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 14:17:25,627 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 14:17:25,627 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 14:17:25,627 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 14:17:25,628 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 14:17:25,628 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 14:17:25,639 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 14:17:25,639 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 14:17:25,640 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 14:17:25,640 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 14:17:25,640 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 14:17:25,640 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 14:17:25,640 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 14:17:25,640 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 14:17:25,640 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 14:17:25,641 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 14:17:25,641 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 14:17:25,641 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 14:17:25,641 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 14:17:25,641 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 14:17:25,642 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 14:17:25,642 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 14:17:25,642 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 14:17:25,642 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 14:17:25,642 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 14:17:25,642 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 14:17:25,642 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 14:17:25,643 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 14:17:25,643 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 14:17:25,643 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 14:17:25,643 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 14:17:25,643 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 14:17:25,643 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 14:17:25,643 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:17:25,644 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 14:17:25,644 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 14:17:25,644 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 14:17:25,644 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 14:17:25,644 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 14:17:25,644 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 14:17:25,644 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 14:17:25,644 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan 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(__VERIFIER_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 -> 65a8838494b0fa2a560742eb829642f08a5d8cc8 [2018-11-23 14:17:25,671 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 14:17:25,679 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 14:17:25,681 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 14:17:25,682 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 14:17:25,683 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 14:17:25,683 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1231_true-unreach-call.c [2018-11-23 14:17:25,719 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/data/55b1cea7f/4875d8c4154e43769e97e77dd054f8f6/FLAGf36ba6db7 [2018-11-23 14:17:26,116 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 14:17:26,116 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/sv-benchmarks/c/float-newlib/float_req_bl_1231_true-unreach-call.c [2018-11-23 14:17:26,120 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/data/55b1cea7f/4875d8c4154e43769e97e77dd054f8f6/FLAGf36ba6db7 [2018-11-23 14:17:26,129 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/data/55b1cea7f/4875d8c4154e43769e97e77dd054f8f6 [2018-11-23 14:17:26,130 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 14:17:26,131 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 14:17:26,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 14:17:26,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 14:17:26,135 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 14:17:26,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:17:26" (1/1) ... [2018-11-23 14:17:26,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d0518e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:26, skipping insertion in model container [2018-11-23 14:17:26,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:17:26" (1/1) ... [2018-11-23 14:17:26,146 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 14:17:26,165 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 14:17:26,297 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:17:26,300 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 14:17:26,319 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 14:17:26,337 INFO L195 MainTranslator]: Completed translation [2018-11-23 14:17:26,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:26 WrapperNode [2018-11-23 14:17:26,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 14:17:26,338 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 14:17:26,338 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 14:17:26,338 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 14:17:26,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:26" (1/1) ... [2018-11-23 14:17:26,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:26" (1/1) ... [2018-11-23 14:17:26,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 14:17:26,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 14:17:26,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 14:17:26,355 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 14:17:26,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:26" (1/1) ... [2018-11-23 14:17:26,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:26" (1/1) ... [2018-11-23 14:17:26,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:26" (1/1) ... [2018-11-23 14:17:26,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:26" (1/1) ... [2018-11-23 14:17:26,370 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:26" (1/1) ... [2018-11-23 14:17:26,373 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:26" (1/1) ... [2018-11-23 14:17:26,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:26" (1/1) ... [2018-11-23 14:17:26,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 14:17:26,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 14:17:26,377 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 14:17:26,378 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 14:17:26,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 14:17:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 14:17:26,452 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 14:17:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2018-11-23 14:17:26,452 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2018-11-23 14:17:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2018-11-23 14:17:26,452 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2018-11-23 14:17:26,452 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_float [2018-11-23 14:17:26,452 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_float [2018-11-23 14:17:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 14:17:26,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 14:17:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 14:17:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 14:17:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 14:17:26,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 14:17:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-23 14:17:26,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 14:17:26,642 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 14:17:26,665 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 14:17:26,666 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 14:17:26,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:17:26 BoogieIcfgContainer [2018-11-23 14:17:26,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 14:17:26,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 14:17:26,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 14:17:26,668 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 14:17:26,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:17:26" (1/3) ... [2018-11-23 14:17:26,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7280ea63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:17:26, skipping insertion in model container [2018-11-23 14:17:26,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:17:26" (2/3) ... [2018-11-23 14:17:26,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7280ea63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:17:26, skipping insertion in model container [2018-11-23 14:17:26,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:17:26" (3/3) ... [2018-11-23 14:17:26,670 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231_true-unreach-call.c [2018-11-23 14:17:26,677 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 14:17:26,681 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-11-23 14:17:26,693 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-11-23 14:17:26,711 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 14:17:26,712 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 14:17:26,712 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 14:17:26,712 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 14:17:26,712 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 14:17:26,712 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 14:17:26,712 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 14:17:26,712 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 14:17:26,712 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 14:17:26,725 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-11-23 14:17:26,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 14:17:26,731 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:26,731 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:26,733 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:26,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:26,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1017347723, now seen corresponding path program 1 times [2018-11-23 14:17:26,739 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:26,740 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:26,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:26,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:26,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:17:26,818 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:17:26,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:17:26,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 14:17:26,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 14:17:26,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 14:17:26,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 14:17:26,843 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-11-23 14:17:26,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:26,861 INFO L93 Difference]: Finished difference Result 105 states and 146 transitions. [2018-11-23 14:17:26,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 14:17:26,862 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 35 [2018-11-23 14:17:26,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:26,869 INFO L225 Difference]: With dead ends: 105 [2018-11-23 14:17:26,869 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 14:17:26,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 14:17:26,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 14:17:26,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-23 14:17:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 14:17:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2018-11-23 14:17:26,903 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 35 [2018-11-23 14:17:26,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:26,905 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2018-11-23 14:17:26,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 14:17:26,905 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2018-11-23 14:17:26,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 14:17:26,907 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:26,907 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:26,907 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:26,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:26,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1223757215, now seen corresponding path program 1 times [2018-11-23 14:17:26,908 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:26,908 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:26,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:26,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:26,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 14:17:26,997 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:17:27,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:17:27,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:17:27,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:17:27,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:17:27,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:17:27,007 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand 4 states. [2018-11-23 14:17:27,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:27,059 INFO L93 Difference]: Finished difference Result 108 states and 143 transitions. [2018-11-23 14:17:27,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 14:17:27,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-23 14:17:27,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:27,061 INFO L225 Difference]: With dead ends: 108 [2018-11-23 14:17:27,061 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 14:17:27,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 14:17:27,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 14:17:27,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2018-11-23 14:17:27,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 14:17:27,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2018-11-23 14:17:27,071 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 36 [2018-11-23 14:17:27,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:27,072 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2018-11-23 14:17:27,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:17:27,072 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2018-11-23 14:17:27,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 14:17:27,073 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:27,073 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:27,074 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:27,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:27,074 INFO L82 PathProgramCache]: Analyzing trace with hash 435900908, now seen corresponding path program 1 times [2018-11-23 14:17:27,074 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:27,075 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:27,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:27,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:27,148 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 14:17:27,148 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:17:27,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:17:27,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:17:27,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:17:27,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:17:27,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:17:27,158 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand 4 states. [2018-11-23 14:17:27,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:27,179 INFO L93 Difference]: Finished difference Result 86 states and 111 transitions. [2018-11-23 14:17:27,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:17:27,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-11-23 14:17:27,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:27,182 INFO L225 Difference]: With dead ends: 86 [2018-11-23 14:17:27,182 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 14:17:27,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:17:27,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 14:17:27,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-23 14:17:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 14:17:27,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2018-11-23 14:17:27,189 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 41 [2018-11-23 14:17:27,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:27,190 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2018-11-23 14:17:27,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:17:27,190 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2018-11-23 14:17:27,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 14:17:27,191 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:27,191 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:27,192 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:27,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:27,192 INFO L82 PathProgramCache]: Analyzing trace with hash -588522803, now seen corresponding path program 1 times [2018-11-23 14:17:27,192 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:27,192 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:27,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:27,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:27,244 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 14:17:27,245 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:17:27,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:17:27,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:17:27,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:17:27,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:17:27,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:17:27,257 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand 4 states. [2018-11-23 14:17:27,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:27,284 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2018-11-23 14:17:27,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:17:27,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-23 14:17:27,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:27,286 INFO L225 Difference]: With dead ends: 89 [2018-11-23 14:17:27,286 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 14:17:27,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:17:27,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 14:17:27,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2018-11-23 14:17:27,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 14:17:27,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2018-11-23 14:17:27,294 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 42 [2018-11-23 14:17:27,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:27,294 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2018-11-23 14:17:27,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:17:27,294 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2018-11-23 14:17:27,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 14:17:27,295 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:27,296 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:27,296 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:27,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:27,296 INFO L82 PathProgramCache]: Analyzing trace with hash -545646832, now seen corresponding path program 1 times [2018-11-23 14:17:27,297 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:27,297 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:27,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:27,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:27,378 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 14:17:27,378 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:17:27,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:17:27,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:17:27,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:17:27,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:17:27,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:17:27,390 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand 4 states. [2018-11-23 14:17:27,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:27,410 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2018-11-23 14:17:27,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:17:27,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-11-23 14:17:27,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:27,412 INFO L225 Difference]: With dead ends: 89 [2018-11-23 14:17:27,412 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 14:17:27,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:17:27,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 14:17:27,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2018-11-23 14:17:27,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 14:17:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2018-11-23 14:17:27,420 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 43 [2018-11-23 14:17:27,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:27,420 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2018-11-23 14:17:27,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:17:27,420 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2018-11-23 14:17:27,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 14:17:27,421 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:27,421 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:27,422 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:27,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:27,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1776219087, now seen corresponding path program 1 times [2018-11-23 14:17:27,422 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:27,422 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:27,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:27,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:27,487 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 14:17:27,487 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:17:27,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:17:27,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:17:27,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:17:27,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:17:27,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:17:27,495 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand 4 states. [2018-11-23 14:17:27,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:27,512 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2018-11-23 14:17:27,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:17:27,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-23 14:17:27,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:27,513 INFO L225 Difference]: With dead ends: 89 [2018-11-23 14:17:27,513 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 14:17:27,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:17:27,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 14:17:27,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2018-11-23 14:17:27,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 14:17:27,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2018-11-23 14:17:27,518 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 44 [2018-11-23 14:17:27,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:27,518 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2018-11-23 14:17:27,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:17:27,518 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2018-11-23 14:17:27,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 14:17:27,519 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:27,519 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:27,519 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:27,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:27,520 INFO L82 PathProgramCache]: Analyzing trace with hash -268667278, now seen corresponding path program 1 times [2018-11-23 14:17:27,520 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:27,520 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:27,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:27,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:27,675 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 14:17:27,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 14:17:27,895 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 14:17:27,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:17:27,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:17:27,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:27,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 14:17:27,949 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:17:27,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:17:27,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 9] total 14 [2018-11-23 14:17:27,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 14:17:27,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 14:17:27,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-11-23 14:17:27,965 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand 14 states. [2018-11-23 14:17:28,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:28,368 INFO L93 Difference]: Finished difference Result 105 states and 136 transitions. [2018-11-23 14:17:28,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 14:17:28,368 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-23 14:17:28,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:28,369 INFO L225 Difference]: With dead ends: 105 [2018-11-23 14:17:28,369 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 14:17:28,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-11-23 14:17:28,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 14:17:28,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2018-11-23 14:17:28,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 14:17:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 102 transitions. [2018-11-23 14:17:28,377 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 102 transitions. Word has length 44 [2018-11-23 14:17:28,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:28,378 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 102 transitions. [2018-11-23 14:17:28,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 14:17:28,378 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2018-11-23 14:17:28,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 14:17:28,379 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:28,379 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:28,379 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:28,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:28,380 INFO L82 PathProgramCache]: Analyzing trace with hash 798294838, now seen corresponding path program 1 times [2018-11-23 14:17:28,380 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:28,380 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:28,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:28,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:28,559 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 14:17:28,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 14:17:28,847 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 14:17:28,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:17:28,854 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:17:28,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:28,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:29,086 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 14:17:29,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 14:17:29,402 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 14:17:29,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2018-11-23 14:17:29,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 11, 11] total 29 [2018-11-23 14:17:29,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 14:17:29,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 14:17:29,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2018-11-23 14:17:29,418 INFO L87 Difference]: Start difference. First operand 77 states and 102 transitions. Second operand 29 states. [2018-11-23 14:17:31,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:31,306 INFO L93 Difference]: Finished difference Result 136 states and 179 transitions. [2018-11-23 14:17:31,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 14:17:31,307 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 49 [2018-11-23 14:17:31,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:31,308 INFO L225 Difference]: With dead ends: 136 [2018-11-23 14:17:31,308 INFO L226 Difference]: Without dead ends: 134 [2018-11-23 14:17:31,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=247, Invalid=1645, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 14:17:31,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-23 14:17:31,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 89. [2018-11-23 14:17:31,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 14:17:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2018-11-23 14:17:31,320 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 49 [2018-11-23 14:17:31,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:31,320 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2018-11-23 14:17:31,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 14:17:31,320 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2018-11-23 14:17:31,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 14:17:31,322 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:31,322 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:31,322 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:31,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:31,323 INFO L82 PathProgramCache]: Analyzing trace with hash 654857827, now seen corresponding path program 1 times [2018-11-23 14:17:31,323 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:31,323 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:31,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:31,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:31,422 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 14:17:31,422 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:17:31,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:17:31,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 14:17:31,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 14:17:31,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 14:17:31,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 14:17:31,430 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand 8 states. [2018-11-23 14:17:31,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:31,689 INFO L93 Difference]: Finished difference Result 158 states and 208 transitions. [2018-11-23 14:17:31,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 14:17:31,689 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-23 14:17:31,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:31,690 INFO L225 Difference]: With dead ends: 158 [2018-11-23 14:17:31,690 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 14:17:31,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-23 14:17:31,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 14:17:31,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 89. [2018-11-23 14:17:31,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 14:17:31,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2018-11-23 14:17:31,701 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 53 [2018-11-23 14:17:31,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:31,701 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2018-11-23 14:17:31,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 14:17:31,701 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2018-11-23 14:17:31,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 14:17:31,702 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:31,702 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:31,703 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:31,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:31,703 INFO L82 PathProgramCache]: Analyzing trace with hash -26719360, now seen corresponding path program 1 times [2018-11-23 14:17:31,703 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:31,703 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:31,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:31,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:31,810 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 14:17:31,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 14:17:31,970 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 14:17:31,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:17:31,982 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:17:31,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:32,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 14:17:32,032 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:17:32,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:17:32,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 9] total 13 [2018-11-23 14:17:32,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 14:17:32,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 14:17:32,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-11-23 14:17:32,048 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand 13 states. [2018-11-23 14:17:32,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:32,326 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2018-11-23 14:17:32,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 14:17:32,326 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 58 [2018-11-23 14:17:32,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:32,327 INFO L225 Difference]: With dead ends: 110 [2018-11-23 14:17:32,327 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 14:17:32,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-11-23 14:17:32,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 14:17:32,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 89. [2018-11-23 14:17:32,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 14:17:32,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 117 transitions. [2018-11-23 14:17:32,336 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 117 transitions. Word has length 58 [2018-11-23 14:17:32,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:32,336 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 117 transitions. [2018-11-23 14:17:32,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 14:17:32,336 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2018-11-23 14:17:32,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 14:17:32,337 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:32,337 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:32,337 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:32,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:32,337 INFO L82 PathProgramCache]: Analyzing trace with hash 2129131098, now seen corresponding path program 1 times [2018-11-23 14:17:32,338 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:32,338 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:32,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:32,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:32,412 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 14:17:32,412 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:17:32,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:17:32,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:17:32,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:17:32,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:17:32,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:17:32,424 INFO L87 Difference]: Start difference. First operand 89 states and 117 transitions. Second operand 4 states. [2018-11-23 14:17:32,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:32,436 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2018-11-23 14:17:32,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:17:32,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-11-23 14:17:32,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:32,438 INFO L225 Difference]: With dead ends: 119 [2018-11-23 14:17:32,438 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 14:17:32,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:17:32,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 14:17:32,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-23 14:17:32,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 14:17:32,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. [2018-11-23 14:17:32,446 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 121 transitions. Word has length 61 [2018-11-23 14:17:32,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:32,446 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 121 transitions. [2018-11-23 14:17:32,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:17:32,446 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2018-11-23 14:17:32,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 14:17:32,446 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:32,447 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:32,447 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:32,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:32,447 INFO L82 PathProgramCache]: Analyzing trace with hash 660120899, now seen corresponding path program 1 times [2018-11-23 14:17:32,447 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:32,447 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:32,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:32,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 14:17:32,499 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:17:32,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:17:32,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:17:32,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:17:32,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:17:32,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:17:32,506 INFO L87 Difference]: Start difference. First operand 92 states and 121 transitions. Second operand 4 states. [2018-11-23 14:17:32,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:32,517 INFO L93 Difference]: Finished difference Result 122 states and 158 transitions. [2018-11-23 14:17:32,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:17:32,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-11-23 14:17:32,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:32,519 INFO L225 Difference]: With dead ends: 122 [2018-11-23 14:17:32,519 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 14:17:32,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:17:32,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 14:17:32,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-11-23 14:17:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 14:17:32,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. [2018-11-23 14:17:32,526 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 121 transitions. Word has length 62 [2018-11-23 14:17:32,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:32,526 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 121 transitions. [2018-11-23 14:17:32,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:17:32,527 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2018-11-23 14:17:32,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 14:17:32,527 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:32,527 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:32,528 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:32,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:32,528 INFO L82 PathProgramCache]: Analyzing trace with hash -931228901, now seen corresponding path program 1 times [2018-11-23 14:17:32,528 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:32,528 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:32,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:32,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:32,729 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 14:17:32,729 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:17:32,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:17:32,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 14:17:32,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 14:17:32,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 14:17:32,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-23 14:17:32,737 INFO L87 Difference]: Start difference. First operand 92 states and 121 transitions. Second operand 11 states. [2018-11-23 14:17:33,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:33,320 INFO L93 Difference]: Finished difference Result 124 states and 162 transitions. [2018-11-23 14:17:33,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 14:17:33,321 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 14:17:33,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:33,322 INFO L225 Difference]: With dead ends: 124 [2018-11-23 14:17:33,322 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 14:17:33,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-11-23 14:17:33,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 14:17:33,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 97. [2018-11-23 14:17:33,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 14:17:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 128 transitions. [2018-11-23 14:17:33,330 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 128 transitions. Word has length 56 [2018-11-23 14:17:33,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:33,331 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 128 transitions. [2018-11-23 14:17:33,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 14:17:33,331 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 128 transitions. [2018-11-23 14:17:33,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 14:17:33,331 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:33,332 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:33,332 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:33,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:33,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1062915805, now seen corresponding path program 1 times [2018-11-23 14:17:33,332 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:33,332 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:33,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:33,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:33,511 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 14:17:33,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 14:17:33,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:17:33,685 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:17:33,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:33,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:33,730 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 14:17:33,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 14:17:33,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:17:33,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-23 14:17:33,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 14:17:33,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 14:17:33,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-23 14:17:33,896 INFO L87 Difference]: Start difference. First operand 97 states and 128 transitions. Second operand 8 states. [2018-11-23 14:17:34,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:34,491 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2018-11-23 14:17:34,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 14:17:34,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-11-23 14:17:34,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:34,492 INFO L225 Difference]: With dead ends: 136 [2018-11-23 14:17:34,492 INFO L226 Difference]: Without dead ends: 116 [2018-11-23 14:17:34,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-11-23 14:17:34,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-11-23 14:17:34,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2018-11-23 14:17:34,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 14:17:34,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 131 transitions. [2018-11-23 14:17:34,501 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 131 transitions. Word has length 56 [2018-11-23 14:17:34,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:34,501 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 131 transitions. [2018-11-23 14:17:34,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 14:17:34,502 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 131 transitions. [2018-11-23 14:17:34,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 14:17:34,502 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:34,502 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:34,502 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:34,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:34,503 INFO L82 PathProgramCache]: Analyzing trace with hash -996587585, now seen corresponding path program 1 times [2018-11-23 14:17:34,503 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:34,503 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:34,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:34,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:34,714 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 14:17:34,714 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:17:34,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:17:34,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 14:17:34,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 14:17:34,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 14:17:34,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 14:17:34,722 INFO L87 Difference]: Start difference. First operand 100 states and 131 transitions. Second operand 9 states. [2018-11-23 14:17:35,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:35,287 INFO L93 Difference]: Finished difference Result 148 states and 189 transitions. [2018-11-23 14:17:35,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 14:17:35,288 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2018-11-23 14:17:35,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:35,288 INFO L225 Difference]: With dead ends: 148 [2018-11-23 14:17:35,288 INFO L226 Difference]: Without dead ends: 124 [2018-11-23 14:17:35,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-23 14:17:35,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-23 14:17:35,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 97. [2018-11-23 14:17:35,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 14:17:35,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2018-11-23 14:17:35,295 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 126 transitions. Word has length 63 [2018-11-23 14:17:35,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:35,296 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 126 transitions. [2018-11-23 14:17:35,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 14:17:35,296 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2018-11-23 14:17:35,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 14:17:35,296 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:35,297 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:35,297 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:35,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:35,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1505315820, now seen corresponding path program 1 times [2018-11-23 14:17:35,297 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:35,297 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:35,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:35,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:35,343 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 14:17:35,343 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:17:35,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:17:35,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:17:35,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:17:35,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:17:35,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:17:35,351 INFO L87 Difference]: Start difference. First operand 97 states and 126 transitions. Second operand 4 states. [2018-11-23 14:17:35,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:35,367 INFO L93 Difference]: Finished difference Result 127 states and 163 transitions. [2018-11-23 14:17:35,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:17:35,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-11-23 14:17:35,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:35,368 INFO L225 Difference]: With dead ends: 127 [2018-11-23 14:17:35,368 INFO L226 Difference]: Without dead ends: 100 [2018-11-23 14:17:35,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:17:35,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-23 14:17:35,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-11-23 14:17:35,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 14:17:35,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2018-11-23 14:17:35,378 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 126 transitions. Word has length 56 [2018-11-23 14:17:35,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:35,379 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 126 transitions. [2018-11-23 14:17:35,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:17:35,379 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2018-11-23 14:17:35,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 14:17:35,379 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:35,380 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 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, 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, 1] [2018-11-23 14:17:35,380 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:35,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:35,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1712579960, now seen corresponding path program 1 times [2018-11-23 14:17:35,380 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:35,380 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:35,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:35,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:35,836 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 14:17:35,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 14:17:35,969 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2018-11-23 14:17:36,490 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2018-11-23 14:17:36,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:17:36,712 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:17:36,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:36,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 14:17:36,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 14:17:37,058 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2018-11-23 14:17:37,565 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2018-11-23 14:17:37,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 14:17:37,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 17 [2018-11-23 14:17:37,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 14:17:37,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 14:17:37,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-11-23 14:17:37,783 INFO L87 Difference]: Start difference. First operand 97 states and 126 transitions. Second operand 17 states. [2018-11-23 14:17:39,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:39,283 INFO L93 Difference]: Finished difference Result 154 states and 201 transitions. [2018-11-23 14:17:39,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 14:17:39,283 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2018-11-23 14:17:39,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:39,284 INFO L225 Difference]: With dead ends: 154 [2018-11-23 14:17:39,284 INFO L226 Difference]: Without dead ends: 127 [2018-11-23 14:17:39,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 156 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2018-11-23 14:17:39,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-23 14:17:39,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 109. [2018-11-23 14:17:39,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-23 14:17:39,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2018-11-23 14:17:39,293 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 143 transitions. Word has length 63 [2018-11-23 14:17:39,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:39,294 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 143 transitions. [2018-11-23 14:17:39,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 14:17:39,294 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 143 transitions. [2018-11-23 14:17:39,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 14:17:39,294 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:39,294 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:39,295 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:39,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:39,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1665293146, now seen corresponding path program 1 times [2018-11-23 14:17:39,295 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:39,295 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:39,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:39,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:39,398 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 14:17:39,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 14:17:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 14:17:39,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:17:39,583 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:17:39,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:39,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:39,646 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 14:17:39,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 14:17:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 14:17:39,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 14:17:39,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10, 12] total 17 [2018-11-23 14:17:39,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 14:17:39,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 14:17:39,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-11-23 14:17:39,802 INFO L87 Difference]: Start difference. First operand 109 states and 143 transitions. Second operand 17 states. [2018-11-23 14:17:40,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:40,201 INFO L93 Difference]: Finished difference Result 149 states and 192 transitions. [2018-11-23 14:17:40,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 14:17:40,201 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 64 [2018-11-23 14:17:40,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:40,202 INFO L225 Difference]: With dead ends: 149 [2018-11-23 14:17:40,202 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 14:17:40,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2018-11-23 14:17:40,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 14:17:40,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 105. [2018-11-23 14:17:40,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 14:17:40,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 135 transitions. [2018-11-23 14:17:40,209 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 135 transitions. Word has length 64 [2018-11-23 14:17:40,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:40,209 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 135 transitions. [2018-11-23 14:17:40,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 14:17:40,210 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 135 transitions. [2018-11-23 14:17:40,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 14:17:40,210 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:40,210 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:40,211 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:40,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:40,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2049769800, now seen corresponding path program 1 times [2018-11-23 14:17:40,211 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:40,211 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:40,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:40,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 14:17:40,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 14:17:40,796 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 14:17:40,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:17:40,803 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:17:40,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:40,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:41,020 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 14:17:41,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 14:17:41,442 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 14:17:41,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2018-11-23 14:17:41,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 12, 12] total 31 [2018-11-23 14:17:41,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 14:17:41,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 14:17:41,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2018-11-23 14:17:41,458 INFO L87 Difference]: Start difference. First operand 105 states and 135 transitions. Second operand 31 states. [2018-11-23 14:17:43,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:43,150 INFO L93 Difference]: Finished difference Result 174 states and 224 transitions. [2018-11-23 14:17:43,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 14:17:43,150 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 57 [2018-11-23 14:17:43,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:43,151 INFO L225 Difference]: With dead ends: 174 [2018-11-23 14:17:43,151 INFO L226 Difference]: Without dead ends: 172 [2018-11-23 14:17:43,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=258, Invalid=1904, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 14:17:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-23 14:17:43,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 97. [2018-11-23 14:17:43,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 14:17:43,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2018-11-23 14:17:43,162 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 57 [2018-11-23 14:17:43,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:43,162 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2018-11-23 14:17:43,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 14:17:43,162 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2018-11-23 14:17:43,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 14:17:43,163 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:43,163 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:43,163 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:43,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:43,164 INFO L82 PathProgramCache]: Analyzing trace with hash 685789633, now seen corresponding path program 1 times [2018-11-23 14:17:43,164 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:43,164 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:43,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:43,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:43,218 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-23 14:17:43,218 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:17:43,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:17:43,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:17:43,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:17:43,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:17:43,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:17:43,230 INFO L87 Difference]: Start difference. First operand 97 states and 125 transitions. Second operand 4 states. [2018-11-23 14:17:43,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:43,243 INFO L93 Difference]: Finished difference Result 128 states and 162 transitions. [2018-11-23 14:17:43,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:17:43,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-11-23 14:17:43,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:43,245 INFO L225 Difference]: With dead ends: 128 [2018-11-23 14:17:43,245 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 14:17:43,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:17:43,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 14:17:43,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-11-23 14:17:43,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 14:17:43,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions. [2018-11-23 14:17:43,252 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 57 [2018-11-23 14:17:43,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:43,252 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions. [2018-11-23 14:17:43,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:17:43,252 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2018-11-23 14:17:43,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 14:17:43,253 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:43,253 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:43,253 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:43,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:43,253 INFO L82 PathProgramCache]: Analyzing trace with hash 276965408, now seen corresponding path program 1 times [2018-11-23 14:17:43,254 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:43,254 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:43,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:43,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:43,750 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 14:17:43,750 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:17:43,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:17:43,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-23 14:17:43,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 14:17:43,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 14:17:43,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-11-23 14:17:43,758 INFO L87 Difference]: Start difference. First operand 95 states and 121 transitions. Second operand 15 states. [2018-11-23 14:17:44,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:44,925 INFO L93 Difference]: Finished difference Result 153 states and 199 transitions. [2018-11-23 14:17:44,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 14:17:44,925 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-11-23 14:17:44,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:44,926 INFO L225 Difference]: With dead ends: 153 [2018-11-23 14:17:44,926 INFO L226 Difference]: Without dead ends: 126 [2018-11-23 14:17:44,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-11-23 14:17:44,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-23 14:17:44,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 105. [2018-11-23 14:17:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 14:17:44,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 134 transitions. [2018-11-23 14:17:44,937 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 134 transitions. Word has length 57 [2018-11-23 14:17:44,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:44,937 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 134 transitions. [2018-11-23 14:17:44,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 14:17:44,937 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 134 transitions. [2018-11-23 14:17:44,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 14:17:44,938 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:44,938 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1] [2018-11-23 14:17:44,939 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:44,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:44,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1345043593, now seen corresponding path program 1 times [2018-11-23 14:17:44,939 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:44,939 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:44,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:44,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:45,053 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 14:17:45,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 14:17:45,222 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-23 14:17:45,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:17:45,230 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:17:45,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:45,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:45,259 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 14:17:45,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 14:17:45,443 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 14:17:45,471 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-23 14:17:45,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 14:17:45,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8, 9] total 13 [2018-11-23 14:17:45,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 14:17:45,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 14:17:45,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-23 14:17:45,486 INFO L87 Difference]: Start difference. First operand 105 states and 134 transitions. Second operand 13 states. [2018-11-23 14:17:45,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:45,777 INFO L93 Difference]: Finished difference Result 174 states and 211 transitions. [2018-11-23 14:17:45,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 14:17:45,777 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-11-23 14:17:45,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:45,777 INFO L225 Difference]: With dead ends: 174 [2018-11-23 14:17:45,777 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 14:17:45,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-11-23 14:17:45,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 14:17:45,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2018-11-23 14:17:45,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 14:17:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2018-11-23 14:17:45,785 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 69 [2018-11-23 14:17:45,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:45,785 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2018-11-23 14:17:45,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 14:17:45,785 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2018-11-23 14:17:45,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 14:17:45,786 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:45,786 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 14:17:45,786 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:45,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:45,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1068698790, now seen corresponding path program 1 times [2018-11-23 14:17:45,786 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:45,787 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:45,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:45,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:45,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:45,932 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 14:17:45,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 14:17:46,171 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 14:17:46,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:17:46,178 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:17:46,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:46,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:46,261 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 14:17:46,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 14:17:46,459 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 14:17:46,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 14:17:46,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10, 9] total 17 [2018-11-23 14:17:46,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 14:17:46,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 14:17:46,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-11-23 14:17:46,474 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand 17 states. [2018-11-23 14:17:46,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:46,785 INFO L93 Difference]: Finished difference Result 92 states and 110 transitions. [2018-11-23 14:17:46,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 14:17:46,786 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2018-11-23 14:17:46,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:46,786 INFO L225 Difference]: With dead ends: 92 [2018-11-23 14:17:46,786 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 14:17:46,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2018-11-23 14:17:46,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 14:17:46,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-11-23 14:17:46,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 14:17:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2018-11-23 14:17:46,789 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 61 [2018-11-23 14:17:46,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:46,789 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2018-11-23 14:17:46,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 14:17:46,789 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2018-11-23 14:17:46,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 14:17:46,790 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:46,790 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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] [2018-11-23 14:17:46,790 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:46,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:46,791 INFO L82 PathProgramCache]: Analyzing trace with hash -820099601, now seen corresponding path program 1 times [2018-11-23 14:17:46,791 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:46,791 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 34 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:46,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:46,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:46,990 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 14:17:46,991 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:17:46,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:17:46,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 14:17:46,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 14:17:46,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 14:17:46,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 14:17:46,998 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 12 states. [2018-11-23 14:17:47,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:47,693 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2018-11-23 14:17:47,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 14:17:47,694 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 14:17:47,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:47,694 INFO L225 Difference]: With dead ends: 79 [2018-11-23 14:17:47,694 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 14:17:47,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 14:17:47,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 14:17:47,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 14:17:47,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 14:17:47,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2018-11-23 14:17:47,697 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 70 [2018-11-23 14:17:47,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:47,697 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2018-11-23 14:17:47,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 14:17:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2018-11-23 14:17:47,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 14:17:47,698 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:47,698 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1] [2018-11-23 14:17:47,698 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:47,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:47,698 INFO L82 PathProgramCache]: Analyzing trace with hash -429306586, now seen corresponding path program 1 times [2018-11-23 14:17:47,698 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:47,699 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 35 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:47,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:47,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:47,998 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 14:17:47,998 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:17:48,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:17:48,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 14:17:48,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 14:17:48,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 14:17:48,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 14:17:48,010 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 12 states. [2018-11-23 14:17:48,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:48,719 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2018-11-23 14:17:48,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 14:17:48,719 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-11-23 14:17:48,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:48,719 INFO L225 Difference]: With dead ends: 81 [2018-11-23 14:17:48,720 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 14:17:48,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 14:17:48,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 14:17:48,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-23 14:17:48,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 14:17:48,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2018-11-23 14:17:48,723 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 71 [2018-11-23 14:17:48,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:48,723 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2018-11-23 14:17:48,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 14:17:48,724 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2018-11-23 14:17:48,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 14:17:48,724 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:48,724 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1] [2018-11-23 14:17:48,724 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:48,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:48,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1994702002, now seen corresponding path program 1 times [2018-11-23 14:17:48,725 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:48,725 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 36 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:48,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:48,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:48,899 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-23 14:17:48,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 14:17:49,470 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-23 14:17:49,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 14:17:49,482 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 14:17:49,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:49,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:49,835 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-23 14:17:49,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 14:17:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-23 14:17:50,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 14:17:50,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12, 13] total 34 [2018-11-23 14:17:50,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 14:17:50,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 14:17:50,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 14:17:50,281 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 34 states. [2018-11-23 14:17:51,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:51,578 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2018-11-23 14:17:51,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 14:17:51,579 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 71 [2018-11-23 14:17:51,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:51,579 INFO L225 Difference]: With dead ends: 97 [2018-11-23 14:17:51,579 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 14:17:51,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 248 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=203, Invalid=1437, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 14:17:51,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 14:17:51,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 57. [2018-11-23 14:17:51,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 14:17:51,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2018-11-23 14:17:51,584 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 71 [2018-11-23 14:17:51,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:51,584 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2018-11-23 14:17:51,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 14:17:51,585 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2018-11-23 14:17:51,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 14:17:51,585 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:51,585 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1] [2018-11-23 14:17:51,585 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:51,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:51,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1572781779, now seen corresponding path program 1 times [2018-11-23 14:17:51,585 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:51,585 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 38 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:51,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:51,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:51,880 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 14:17:51,880 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:17:51,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:17:51,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 14:17:51,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 14:17:51,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 14:17:51,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 14:17:51,888 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 12 states. [2018-11-23 14:17:52,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:52,703 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2018-11-23 14:17:52,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 14:17:52,704 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2018-11-23 14:17:52,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:52,704 INFO L225 Difference]: With dead ends: 80 [2018-11-23 14:17:52,704 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 14:17:52,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 14:17:52,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 14:17:52,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-11-23 14:17:52,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 14:17:52,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2018-11-23 14:17:52,707 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 72 [2018-11-23 14:17:52,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:52,707 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2018-11-23 14:17:52,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 14:17:52,707 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2018-11-23 14:17:52,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 14:17:52,708 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:52,708 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1] [2018-11-23 14:17:52,708 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:52,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:52,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1985418442, now seen corresponding path program 1 times [2018-11-23 14:17:52,708 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:52,708 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 39 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:52,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:52,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:52,895 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 14:17:52,895 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:17:52,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:17:52,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 14:17:52,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 14:17:52,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 14:17:52,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 14:17:52,903 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 12 states. [2018-11-23 14:17:53,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:53,476 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2018-11-23 14:17:53,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 14:17:53,476 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2018-11-23 14:17:53,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:53,477 INFO L225 Difference]: With dead ends: 78 [2018-11-23 14:17:53,477 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 14:17:53,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 14:17:53,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 14:17:53,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-23 14:17:53,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 14:17:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-11-23 14:17:53,481 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 73 [2018-11-23 14:17:53,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:53,481 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-11-23 14:17:53,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 14:17:53,481 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-11-23 14:17:53,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 14:17:53,482 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 14:17:53,482 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1] [2018-11-23 14:17:53,482 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 14:17:53,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 14:17:53,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1616447157, now seen corresponding path program 1 times [2018-11-23 14:17:53,482 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 14:17:53,482 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/mathsat Starting monitored process 40 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with mathsat -unsat_core_generation=3 [2018-11-23 14:17:53,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 14:17:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 14:17:53,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 14:17:53,547 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 14:17:53,547 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 14:17:53,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 14:17:53,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 14:17:53,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 14:17:53,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 14:17:53,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:17:53,559 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 4 states. [2018-11-23 14:17:53,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 14:17:53,566 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-23 14:17:53,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 14:17:53,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-11-23 14:17:53,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 14:17:53,568 INFO L225 Difference]: With dead ends: 58 [2018-11-23 14:17:53,568 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 14:17:53,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 14:17:53,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 14:17:53,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 14:17:53,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 14:17:53,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 14:17:53,569 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2018-11-23 14:17:53,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 14:17:53,569 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 14:17:53,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 14:17:53,569 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 14:17:53,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 14:17:53,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 14:17:53,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 14:17:53,974 INFO L448 ceAbstractionStarter]: For program point isnan_floatFINAL(line 57) no Hoare annotation was computed. [2018-11-23 14:17:53,974 INFO L451 ceAbstractionStarter]: At program point isnan_floatENTRY(line 57) the Hoare annotation is: true [2018-11-23 14:17:53,974 INFO L448 ceAbstractionStarter]: For program point isnan_floatEXIT(line 57) no Hoare annotation was computed. [2018-11-23 14:17:53,974 INFO L451 ceAbstractionStarter]: At program point fmin_floatENTRY(lines 35 42) the Hoare annotation is: true [2018-11-23 14:17:53,974 INFO L448 ceAbstractionStarter]: For program point fmin_floatEXIT(lines 35 42) no Hoare annotation was computed. [2018-11-23 14:17:53,974 INFO L448 ceAbstractionStarter]: For program point fmin_floatFINAL(lines 35 42) no Hoare annotation was computed. [2018-11-23 14:17:53,974 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2018-11-23 14:17:53,974 INFO L448 ceAbstractionStarter]: For program point L41-2(line 41) no Hoare annotation was computed. [2018-11-23 14:17:53,974 INFO L444 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (and (= fmin_float_~x |fmin_float_#in~x|) (= fmin_float_~y |fmin_float_#in~y|)) [2018-11-23 14:17:53,974 INFO L448 ceAbstractionStarter]: For program point L38-1(lines 38 39) no Hoare annotation was computed. [2018-11-23 14:17:53,974 INFO L444 ceAbstractionStarter]: At program point L36(line 36) the Hoare annotation is: (and (= fmin_float_~x |fmin_float_#in~x|) (= fmin_float_~y |fmin_float_#in~y|)) [2018-11-23 14:17:53,975 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 36 37) no Hoare annotation was computed. [2018-11-23 14:17:53,975 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 14:17:53,975 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 14:17:53,975 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 14:17:53,975 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 14:17:53,975 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 14:17:53,975 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 14:17:53,975 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 14:17:53,975 INFO L444 ceAbstractionStarter]: At program point L68-3(line 68) the Hoare annotation is: (and (= (_ bv1 32) |main_#t~ret9|) |main_#t~short11| (not (fp.eq main_~x~0 main_~x~0))) [2018-11-23 14:17:53,975 INFO L448 ceAbstractionStarter]: For program point L68-4(line 68) no Hoare annotation was computed. [2018-11-23 14:17:53,975 INFO L448 ceAbstractionStarter]: For program point L68-6(line 68) no Hoare annotation was computed. [2018-11-23 14:17:53,975 INFO L448 ceAbstractionStarter]: For program point L68-7(lines 68 69) no Hoare annotation was computed. [2018-11-23 14:17:53,975 INFO L448 ceAbstractionStarter]: For program point L68-9(lines 68 84) no Hoare annotation was computed. [2018-11-23 14:17:53,975 INFO L448 ceAbstractionStarter]: For program point L68-11(lines 68 84) no Hoare annotation was computed. [2018-11-23 14:17:53,975 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 59 87) no Hoare annotation was computed. [2018-11-23 14:17:53,976 INFO L448 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-11-23 14:17:53,976 INFO L444 ceAbstractionStarter]: At program point L69(line 69) the Hoare annotation is: (let ((.cse0 (not |main_#t~short11|)) (.cse2 (fp.eq main_~x~0 main_~x~0)) (.cse1 (not |main_#t~short15|))) (or (and .cse0 .cse1 (= (_ bv1 32) |main_#t~ret9|) (= (bvadd |main_#t~ret10| (_ bv4294967295 32)) (_ bv0 32)) (not (fp.eq main_~y~0 main_~y~0)) (not .cse2)) (and .cse0 .cse2 .cse1 (= (_ bv0 32) |main_#t~ret9|)))) [2018-11-23 14:17:53,976 INFO L448 ceAbstractionStarter]: For program point L69-1(line 69) no Hoare annotation was computed. [2018-11-23 14:17:53,976 INFO L448 ceAbstractionStarter]: For program point L69-2(line 69) no Hoare annotation was computed. [2018-11-23 14:17:53,976 INFO L444 ceAbstractionStarter]: At program point L69-3(line 69) the Hoare annotation is: (and |main_#t~short14| (not |main_#t~short11|) (fp.eq main_~x~0 main_~x~0) (not |main_#t~short15|) (= |main_#t~ret12| (_ bv0 32)) (= (_ bv0 32) |main_#t~ret9|)) [2018-11-23 14:17:53,976 INFO L448 ceAbstractionStarter]: For program point L69-4(line 69) no Hoare annotation was computed. [2018-11-23 14:17:53,976 INFO L448 ceAbstractionStarter]: For program point L69-6(line 69) no Hoare annotation was computed. [2018-11-23 14:17:53,976 INFO L444 ceAbstractionStarter]: At program point L74(line 74) the Hoare annotation is: (or (and (= main_~y~0 main_~res~0) (not (fp.eq main_~x~0 main_~x~0))) (and (= main_~x~0 main_~res~0) (not (fp.eq main_~y~0 main_~y~0)))) [2018-11-23 14:17:53,976 INFO L448 ceAbstractionStarter]: For program point L74-1(line 74) no Hoare annotation was computed. [2018-11-23 14:17:53,976 INFO L448 ceAbstractionStarter]: For program point L74-2(line 74) no Hoare annotation was computed. [2018-11-23 14:17:53,976 INFO L444 ceAbstractionStarter]: At program point L74-3(line 74) the Hoare annotation is: (and (= main_~y~0 main_~res~0) |main_#t~short19| (= (bvadd |main_#t~ret17| (_ bv4294967295 32)) (_ bv0 32)) (not (fp.eq main_~x~0 main_~x~0))) [2018-11-23 14:17:53,976 INFO L448 ceAbstractionStarter]: For program point L74-4(line 74) no Hoare annotation was computed. [2018-11-23 14:17:53,976 INFO L448 ceAbstractionStarter]: For program point L74-6(lines 74 77) no Hoare annotation was computed. [2018-11-23 14:17:53,977 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 81) no Hoare annotation was computed. [2018-11-23 14:17:53,977 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 59 87) no Hoare annotation was computed. [2018-11-23 14:17:53,977 INFO L448 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-11-23 14:17:53,977 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 75) no Hoare annotation was computed. [2018-11-23 14:17:53,977 INFO L444 ceAbstractionStarter]: At program point L71(line 71) the Hoare annotation is: (let ((.cse1 (fp.eq main_~y~0 main_~y~0)) (.cse0 (fp.eq main_~x~0 main_~x~0))) (or (and .cse0 (not .cse1)) (and .cse1 (not .cse0)))) [2018-11-23 14:17:53,977 INFO L448 ceAbstractionStarter]: For program point L71-1(line 71) no Hoare annotation was computed. [2018-11-23 14:17:53,977 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 59 87) the Hoare annotation is: true [2018-11-23 14:17:53,977 INFO L444 ceAbstractionStarter]: At program point L80(line 80) the Hoare annotation is: (or (and (= main_~x~0 main_~res~0) (not (fp.eq main_~y~0 main_~y~0))) (not (fp.eq main_~x~0 main_~x~0))) [2018-11-23 14:17:53,977 INFO L448 ceAbstractionStarter]: For program point L80-1(line 80) no Hoare annotation was computed. [2018-11-23 14:17:53,977 INFO L448 ceAbstractionStarter]: For program point L80-2(line 80) no Hoare annotation was computed. [2018-11-23 14:17:53,977 INFO L444 ceAbstractionStarter]: At program point L80-3(line 80) the Hoare annotation is: (and (= main_~x~0 main_~res~0) (fp.eq main_~x~0 main_~x~0) |main_#t~short22| (not (fp.eq main_~y~0 main_~y~0))) [2018-11-23 14:17:53,977 INFO L448 ceAbstractionStarter]: For program point L80-4(line 80) no Hoare annotation was computed. [2018-11-23 14:17:53,978 INFO L448 ceAbstractionStarter]: For program point L80-6(lines 80 83) no Hoare annotation was computed. [2018-11-23 14:17:53,978 INFO L451 ceAbstractionStarter]: At program point L68(line 68) the Hoare annotation is: true [2018-11-23 14:17:53,978 INFO L448 ceAbstractionStarter]: For program point L68-1(line 68) no Hoare annotation was computed. [2018-11-23 14:17:53,978 INFO L448 ceAbstractionStarter]: For program point L68-2(line 68) no Hoare annotation was computed. [2018-11-23 14:17:53,978 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 32) no Hoare annotation was computed. [2018-11-23 14:17:53,978 INFO L448 ceAbstractionStarter]: For program point __fpclassify_floatFINAL(lines 12 33) no Hoare annotation was computed. [2018-11-23 14:17:53,978 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 32) no Hoare annotation was computed. [2018-11-23 14:17:53,978 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 15 19) no Hoare annotation was computed. [2018-11-23 14:17:53,978 INFO L444 ceAbstractionStarter]: At program point L15-2(lines 15 19) the Hoare annotation is: (= __fpclassify_float_~x |__fpclassify_float_#in~x|) [2018-11-23 14:17:53,978 INFO L448 ceAbstractionStarter]: For program point L15-3(lines 12 33) no Hoare annotation was computed. [2018-11-23 14:17:53,978 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 32) no Hoare annotation was computed. [2018-11-23 14:17:53,978 INFO L451 ceAbstractionStarter]: At program point __fpclassify_floatENTRY(lines 12 33) the Hoare annotation is: true [2018-11-23 14:17:53,978 INFO L448 ceAbstractionStarter]: For program point __fpclassify_floatEXIT(lines 12 33) no Hoare annotation was computed. [2018-11-23 14:17:53,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:17:53 BoogieIcfgContainer [2018-11-23 14:17:53,988 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 14:17:53,989 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 14:17:53,989 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 14:17:53,989 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 14:17:53,989 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:17:26" (3/4) ... [2018-11-23 14:17:53,992 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 14:17:53,997 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_float [2018-11-23 14:17:53,997 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fmin_float [2018-11-23 14:17:53,997 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 14:17:53,998 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 14:17:53,998 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2018-11-23 14:17:54,002 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-11-23 14:17:54,002 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-23 14:17:54,002 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 14:17:54,019 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: x == \old(x) [2018-11-23 14:17:54,037 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_86975bd3-1893-4b3c-892a-4d73612a53f8/bin-2019/utaipan/witness.graphml [2018-11-23 14:17:54,038 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 14:17:54,038 INFO L168 Benchmark]: Toolchain (without parser) took 27907.46 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 393.7 MB). Free memory was 949.7 MB in the beginning and 875.6 MB in the end (delta: 74.1 MB). Peak memory consumption was 467.9 MB. Max. memory is 11.5 GB. [2018-11-23 14:17:54,039 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:17:54,039 INFO L168 Benchmark]: CACSL2BoogieTranslator took 205.96 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 14:17:54,039 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.75 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:17:54,039 INFO L168 Benchmark]: Boogie Preprocessor took 21.69 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:17:54,039 INFO L168 Benchmark]: RCFGBuilder took 288.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -171.5 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-23 14:17:54,040 INFO L168 Benchmark]: TraceAbstraction took 27321.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 257.4 MB). Free memory was 1.1 GB in the beginning and 875.6 MB in the end (delta: 229.6 MB). Peak memory consumption was 487.0 MB. Max. memory is 11.5 GB. [2018-11-23 14:17:54,040 INFO L168 Benchmark]: Witness Printer took 49.06 ms. Allocated memory is still 1.4 GB. Free memory is still 875.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 14:17:54,041 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 205.96 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.75 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.69 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 288.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -171.5 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27321.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 257.4 MB). Free memory was 1.1 GB in the beginning and 875.6 MB in the end (delta: 229.6 MB). Peak memory consumption was 487.0 MB. Max. memory is 11.5 GB. * Witness Printer took 49.06 ms. Allocated memory is still 1.4 GB. Free memory is still 875.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 81]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 75]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: x == \old(x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 64 locations, 2 error locations. SAFE Result, 27.2s OverallTime, 29 OverallIterations, 6 TraceHistogramMax, 14.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 2002 SDtfs, 1301 SDslu, 12317 SDs, 0 SdLazy, 6583 SolverSat, 461 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3280 GetRequests, 2879 SyntacticMatches, 10 SemanticMatches, 391 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1448 ImplicationChecksByTransitivity, 10.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 29 MinimizatonAttempts, 348 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 168 PreInvPairs, 193 NumberOfFragments, 156 HoareAnnotationTreeSize, 168 FomulaSimplifications, 37790 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 19 FomulaSimplificationsInter, 68 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 2249 NumberOfCodeBlocks, 2249 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3040 ConstructedInterpolants, 35 QuantifiedInterpolants, 557777 SizeOfPredicates, 188 NumberOfNonLiveVariables, 4716 ConjunctsInSsa, 401 ConjunctsInUnsatCore, 53 InterpolantComputations, 23 PerfectInterpolantSequences, 1486/1674 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...