./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1251_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_bea03a69-bb94-4c3a-b644-8d88d0e365f5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1251_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 df3954142d6b55c98b13b60b9fbaf053d4d402ff .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_bea03a69-bb94-4c3a-b644-8d88d0e365f5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1251_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 df3954142d6b55c98b13b60b9fbaf053d4d402ff ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 15:42:26,761 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:42:26,762 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:42:26,769 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:42:26,770 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:42:26,770 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:42:26,771 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:42:26,772 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:42:26,773 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:42:26,774 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:42:26,775 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:42:26,775 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:42:26,775 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:42:26,776 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:42:26,776 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:42:26,777 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:42:26,777 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:42:26,778 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:42:26,780 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:42:26,781 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:42:26,782 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:42:26,783 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:42:26,784 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:42:26,784 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:42:26,784 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:42:26,785 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:42:26,785 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:42:26,786 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:42:26,786 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:42:26,787 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:42:26,787 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:42:26,788 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:42:26,788 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:42:26,788 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:42:26,789 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:42:26,789 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:42:26,790 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 15:42:26,798 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:42:26,798 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:42:26,798 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:42:26,799 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:42:26,799 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 15:42:26,799 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 15:42:26,799 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 15:42:26,799 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 15:42:26,799 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 15:42:26,799 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 15:42:26,800 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 15:42:26,800 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 15:42:26,800 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 15:42:26,800 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:42:26,801 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:42:26,801 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:42:26,801 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:42:26,801 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:42:26,801 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 15:42:26,801 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:42:26,801 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 15:42:26,801 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:42:26,802 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:42:26,802 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:42:26,802 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 15:42:26,802 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:42:26,802 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:42:26,802 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:42:26,802 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:42:26,803 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:42:26,803 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:42:26,803 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:42:26,803 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 15:42:26,803 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 15:42:26,803 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:42:26,803 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 15:42:26,803 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 15:42:26,804 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_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 -> df3954142d6b55c98b13b60b9fbaf053d4d402ff [2018-11-23 15:42:26,828 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:42:26,837 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:42:26,840 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:42:26,841 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:42:26,842 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:42:26,842 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1251_true-unreach-call.c [2018-11-23 15:42:26,887 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/bin-2019/utaipan/data/03b1dd6c9/b4759b5f0ba046e1a455d884304f5217/FLAGe5ab828ce [2018-11-23 15:42:27,283 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:42:27,284 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/sv-benchmarks/c/float-newlib/float_req_bl_1251_true-unreach-call.c [2018-11-23 15:42:27,289 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/bin-2019/utaipan/data/03b1dd6c9/b4759b5f0ba046e1a455d884304f5217/FLAGe5ab828ce [2018-11-23 15:42:27,299 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/bin-2019/utaipan/data/03b1dd6c9/b4759b5f0ba046e1a455d884304f5217 [2018-11-23 15:42:27,301 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:42:27,302 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:42:27,302 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:42:27,302 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:42:27,305 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:42:27,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:42:27" (1/1) ... [2018-11-23 15:42:27,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b02929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:27, skipping insertion in model container [2018-11-23 15:42:27,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:42:27" (1/1) ... [2018-11-23 15:42:27,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:42:27,327 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:42:27,444 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:42:27,446 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:42:27,463 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:42:27,477 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:42:27,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:27 WrapperNode [2018-11-23 15:42:27,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:42:27,478 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:42:27,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:42:27,478 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:42:27,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:27" (1/1) ... [2018-11-23 15:42:27,490 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:27" (1/1) ... [2018-11-23 15:42:27,495 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:42:27,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:42:27,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:42:27,496 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:42:27,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:27" (1/1) ... [2018-11-23 15:42:27,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:27" (1/1) ... [2018-11-23 15:42:27,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:27" (1/1) ... [2018-11-23 15:42:27,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:27" (1/1) ... [2018-11-23 15:42:27,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:27" (1/1) ... [2018-11-23 15:42:27,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:27" (1/1) ... [2018-11-23 15:42:27,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:27" (1/1) ... [2018-11-23 15:42:27,554 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:42:27,555 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:42:27,555 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:42:27,555 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:42:27,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:27,588 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:42:27,588 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:42:27,588 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_float [2018-11-23 15:42:27,589 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_float [2018-11-23 15:42:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2018-11-23 15:42:27,589 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2018-11-23 15:42:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2018-11-23 15:42:27,589 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2018-11-23 15:42:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:42:27,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:42:27,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 15:42:27,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:42:27,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:42:27,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:42:27,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:42:27,590 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:42:27,789 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:42:27,789 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 15:42:27,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:42:27 BoogieIcfgContainer [2018-11-23 15:42:27,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:42:27,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:42:27,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:42:27,792 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:42:27,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:42:27" (1/3) ... [2018-11-23 15:42:27,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72469580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:42:27, skipping insertion in model container [2018-11-23 15:42:27,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:27" (2/3) ... [2018-11-23 15:42:27,793 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72469580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:42:27, skipping insertion in model container [2018-11-23 15:42:27,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:42:27" (3/3) ... [2018-11-23 15:42:27,794 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251_true-unreach-call.c [2018-11-23 15:42:27,800 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:42:27,805 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-11-23 15:42:27,819 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-11-23 15:42:27,837 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:42:27,838 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 15:42:27,838 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:42:27,838 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:42:27,838 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:42:27,838 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:42:27,838 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:42:27,838 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:42:27,850 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-11-23 15:42:27,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 15:42:27,856 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:27,856 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 15:42:27,857 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:27,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:27,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2074573857, now seen corresponding path program 1 times [2018-11-23 15:42:27,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:42:27,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:42:27,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:27,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:42:27,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:42:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:27,965 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 15:42:27,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:42:27,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:42:27,967 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:42:27,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 15:42:27,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 15:42:27,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 15:42:27,980 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2018-11-23 15:42:27,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:27,999 INFO L93 Difference]: Finished difference Result 109 states and 150 transitions. [2018-11-23 15:42:27,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 15:42:28,000 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 36 [2018-11-23 15:42:28,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:28,007 INFO L225 Difference]: With dead ends: 109 [2018-11-23 15:42:28,007 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 15:42:28,010 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 15:42:28,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 15:42:28,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-23 15:42:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 15:42:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2018-11-23 15:42:28,038 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 36 [2018-11-23 15:42:28,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:28,040 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2018-11-23 15:42:28,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 15:42:28,040 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2018-11-23 15:42:28,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 15:42:28,042 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:28,042 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 15:42:28,043 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:28,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:28,043 INFO L82 PathProgramCache]: Analyzing trace with hash -479509601, now seen corresponding path program 1 times [2018-11-23 15:42:28,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:42:28,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:42:28,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:28,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:42:28,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:42:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:28,103 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 15:42:28,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:42:28,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:42:28,104 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:42:28,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:42:28,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:42:28,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:42:28,106 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand 4 states. [2018-11-23 15:42:28,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:28,160 INFO L93 Difference]: Finished difference Result 112 states and 147 transitions. [2018-11-23 15:42:28,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 15:42:28,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-11-23 15:42:28,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:28,162 INFO L225 Difference]: With dead ends: 112 [2018-11-23 15:42:28,162 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 15:42:28,163 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 15:42:28,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 15:42:28,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2018-11-23 15:42:28,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 15:42:28,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2018-11-23 15:42:28,172 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 37 [2018-11-23 15:42:28,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:28,173 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2018-11-23 15:42:28,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:42:28,173 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2018-11-23 15:42:28,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 15:42:28,174 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:28,174 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 15:42:28,174 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:28,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:28,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1695952933, now seen corresponding path program 1 times [2018-11-23 15:42:28,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:42:28,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:42:28,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:28,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:42:28,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:42:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:28,240 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 15:42:28,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:42:28,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:42:28,240 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:42:28,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:42:28,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:42:28,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:42:28,241 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand 4 states. [2018-11-23 15:42:28,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:28,266 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2018-11-23 15:42:28,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:42:28,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-23 15:42:28,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:28,269 INFO L225 Difference]: With dead ends: 89 [2018-11-23 15:42:28,269 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 15:42:28,269 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 15:42:28,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 15:42:28,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-23 15:42:28,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 15:42:28,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2018-11-23 15:42:28,276 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 42 [2018-11-23 15:42:28,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:28,277 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2018-11-23 15:42:28,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:42:28,277 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2018-11-23 15:42:28,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 15:42:28,278 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:28,278 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 15:42:28,278 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:28,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:28,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1516736276, now seen corresponding path program 1 times [2018-11-23 15:42:28,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:42:28,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:42:28,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:28,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:42:28,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:42:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:28,330 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 15:42:28,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:42:28,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:42:28,331 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:42:28,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:42:28,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:42:28,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:42:28,332 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand 4 states. [2018-11-23 15:42:28,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:28,363 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2018-11-23 15:42:28,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:42:28,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-23 15:42:28,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:28,365 INFO L225 Difference]: With dead ends: 93 [2018-11-23 15:42:28,365 INFO L226 Difference]: Without dead ends: 71 [2018-11-23 15:42:28,366 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 15:42:28,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-23 15:42:28,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2018-11-23 15:42:28,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 15:42:28,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 87 transitions. [2018-11-23 15:42:28,373 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 87 transitions. Word has length 45 [2018-11-23 15:42:28,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:28,374 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 87 transitions. [2018-11-23 15:42:28,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:42:28,374 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2018-11-23 15:42:28,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 15:42:28,375 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:28,376 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 15:42:28,376 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:28,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:28,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1006202099, now seen corresponding path program 1 times [2018-11-23 15:42:28,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:42:28,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:42:28,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:28,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:42:28,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:42:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:28,417 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 15:42:28,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:42:28,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:42:28,417 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:42:28,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 15:42:28,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:42:28,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:42:28,418 INFO L87 Difference]: Start difference. First operand 67 states and 87 transitions. Second operand 3 states. [2018-11-23 15:42:28,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:28,439 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2018-11-23 15:42:28,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:42:28,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-11-23 15:42:28,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:28,440 INFO L225 Difference]: With dead ends: 70 [2018-11-23 15:42:28,440 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 15:42:28,440 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 15:42:28,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 15:42:28,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-23 15:42:28,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-23 15:42:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 88 transitions. [2018-11-23 15:42:28,446 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 88 transitions. Word has length 45 [2018-11-23 15:42:28,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:28,447 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 88 transitions. [2018-11-23 15:42:28,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 15:42:28,447 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2018-11-23 15:42:28,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 15:42:28,448 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:28,448 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 15:42:28,448 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:28,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:28,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1226294786, now seen corresponding path program 1 times [2018-11-23 15:42:28,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:42:28,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:42:28,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:28,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:42:28,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:42:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:42:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:42:28,503 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 #130#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret21 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := #t~nondet5;havoc #t~nondet5;~y~0 := #t~nondet6;havoc #t~nondet6; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret7 := 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 #134#return; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=1] [?] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;#t~short9 := 0 != #t~ret7; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=1, |main_#t~short9|=true] [?] assume #t~short9; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=1, |main_#t~short9|=true] [?] CALL call #t~ret8 := 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 #136#return; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=1, |main_#t~ret8|=0, |main_#t~short9|=true] [?] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;#t~short9 := 0 == #t~ret8; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=1, |main_#t~ret8|=0, |main_#t~short9|=true] [?] #t~short13 := #t~short9; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=1, |main_#t~ret8|=0, |main_#t~short13|=true, |main_#t~short9|=true] [?] assume #t~short13; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret7|=1, |main_#t~ret8|=0, |main_#t~short13|=true, |main_#t~short9|=true] [?] assume #t~short13;havoc #t~ret8;havoc #t~short12;havoc #t~ret10;havoc #t~short9;havoc #t~ret7;havoc #t~ret11;havoc #t~short13; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |fmax_float_#in~x|=2139095044.0, |fmax_float_#in~y|=2139095043.0] [?] ~x := #in~x;~y := #in~y; VAL [fmax_float_~x=2139095044.0, fmax_float_~y=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_float_#in~x|=2139095044.0, |fmax_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 #152#return; VAL [fmax_float_~x=2139095044.0, fmax_float_~y=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_float_#in~x|=2139095044.0, |fmax_float_#in~y|=2139095043.0, |fmax_float_#t~ret2|=0] [?] assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647; VAL [fmax_float_~x=2139095044.0, fmax_float_~y=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_float_#in~x|=2139095044.0, |fmax_float_#in~y|=2139095043.0, |fmax_float_#t~ret2|=0] [?] assume 0 == #t~ret2;havoc #t~ret2;#res := ~y; VAL [fmax_float_~x=2139095044.0, fmax_float_~y=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_float_#in~x|=2139095044.0, |fmax_float_#in~y|=2139095043.0, |fmax_float_#res|=2139095043.0] [?] assume true; VAL [fmax_float_~x=2139095044.0, fmax_float_~y=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |fmax_float_#in~x|=2139095044.0, |fmax_float_#in~y|=2139095043.0, |fmax_float_#res|=2139095043.0] [?] RET #142#return; VAL [main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret14|=2139095043.0] [?] ~res~0 := #t~ret14;havoc #t~ret14; 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~ret15 := 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 #144#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~ret15|=1] [?] assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647;#t~short17 := 0 != #t~ret15; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret15|=1, |main_#t~short17|=true] [?] assume #t~short17; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret15|=1, |main_#t~short17|=true] [?] CALL call #t~ret16 := 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 #146#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~ret15|=1, |main_#t~ret16|=0, |main_#t~short17|=true] [?] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647;#t~short17 := 0 == #t~ret16; VAL [main_~res~0=2139095043.0, main_~x~0=2139095044.0, main_~y~0=2139095043.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret15|=1, |main_#t~ret16|=0, |main_#t~short17|=true] [?] assume #t~short17 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0);havoc #t~ret15;havoc #t~ret16;havoc #t~short17; 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~ret21 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L64] ~x~0 := #t~nondet5; [L64] havoc #t~nondet5; [L65] ~y~0 := #t~nondet6; [L65] havoc #t~nondet6; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] CALL call #t~ret7 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0] [L55] ~x := #in~x; [L55] #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] [L55] ensures true; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L67] RET call #t~ret7 := isnan_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L67] #t~short9 := 0 != #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume #t~short9; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] CALL call #t~ret8 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L55] ~x := #in~x; [L55] #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] [L55] ensures true; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L67] RET call #t~ret8 := isnan_float(~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, #t~ret8=0, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L67] #t~short9 := 0 == #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, #t~ret8=0, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] #t~short13 := #t~short9; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, #t~ret8=0, #t~short13=true, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] assume #t~short13; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, #t~ret8=0, #t~short13=true, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L83] assume #t~short13; [L67] havoc #t~ret8; [L68] havoc #t~short12; [L68] havoc #t~ret10; [L67] havoc #t~short9; [L67] havoc #t~ret7; [L68] havoc #t~ret11; [L67-L68] havoc #t~short13; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L70] CALL call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L43-L52] ~x := #in~x; [L43-L52] ~y := #in~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095044E9, ~y=2.139095043E9] [L44] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0] [L20-L41] ~x := #in~x; [L21] havoc ~w~0; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095044E9] [L24] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L25] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L26] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L26] ~w~0 := #t~mem0; [L26] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L26] havoc #t~mem0; [L26] havoc #t~union1; [L24] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L24] 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] [L29-L40] 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] [L31-L40] 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] [L34-L40] 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] [L37-L40] assume !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296); [L40] #res := 0; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L20-L41] ensures true; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L44] 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] [L44] 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] [L44-L46] assume 0 == #t~ret2; [L44] havoc #t~ret2; [L45] #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] [L43-L52] 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] [L70] RET call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret14=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L70] ~res~0 := #t~ret14; [L70] havoc #t~ret14; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] CALL call #t~ret15 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0] [L55] ~x := #in~x; [L55] #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] [L55] ensures true; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L73] RET call #t~ret15 := isnan_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret15=1, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647; [L73] #t~short17 := 0 != #t~ret15; VAL [#NULL.base=0, #NULL.offset=0, #t~ret15=1, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume #t~short17; VAL [#NULL.base=0, #NULL.offset=0, #t~ret15=1, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] CALL call #t~ret16 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L55] ~x := #in~x; [L55] #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] [L55] ensures true; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L73] RET call #t~ret16 := isnan_float(~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret15=1, #t~ret16=0, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; [L73] #t~short17 := 0 == #t~ret16; VAL [#NULL.base=0, #NULL.offset=0, #t~ret15=1, #t~ret16=0, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73-L76] assume #t~short17 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0); [L73] havoc #t~ret15; [L73] havoc #t~ret16; [L73] havoc #t~short17; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] 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~ret21 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L64] ~x~0 := #t~nondet5; [L64] havoc #t~nondet5; [L65] ~y~0 := #t~nondet6; [L65] havoc #t~nondet6; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] CALL call #t~ret7 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0] [L55] ~x := #in~x; [L55] #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] [L55] ensures true; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L67] RET call #t~ret7 := isnan_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L67] #t~short9 := 0 != #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume #t~short9; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] CALL call #t~ret8 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L55] ~x := #in~x; [L55] #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] [L55] ensures true; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L67] RET call #t~ret8 := isnan_float(~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, #t~ret8=0, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L67] #t~short9 := 0 == #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, #t~ret8=0, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] #t~short13 := #t~short9; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, #t~ret8=0, #t~short13=true, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] assume #t~short13; VAL [#NULL.base=0, #NULL.offset=0, #t~ret7=1, #t~ret8=0, #t~short13=true, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L83] assume #t~short13; [L67] havoc #t~ret8; [L68] havoc #t~short12; [L68] havoc #t~ret10; [L67] havoc #t~short9; [L67] havoc #t~ret7; [L68] havoc #t~ret11; [L67-L68] havoc #t~short13; VAL [#NULL.base=0, #NULL.offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L70] CALL call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L43-L52] ~x := #in~x; [L43-L52] ~y := #in~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095044E9, ~y=2.139095043E9] [L44] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0] [L20-L41] ~x := #in~x; [L21] havoc ~w~0; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, ~x=2.139095044E9] [L24] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L25] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L26] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L26] ~w~0 := #t~mem0; [L26] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L26] havoc #t~mem0; [L26] havoc #t~union1; [L24] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L24] 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] [L29-L40] 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] [L31-L40] 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] [L34-L40] 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] [L37-L40] assume !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296); [L40] #res := 0; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L20-L41] ensures true; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L44] 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] [L44] 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] [L44-L46] assume 0 == #t~ret2; [L44] havoc #t~ret2; [L45] #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] [L43-L52] 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] [L70] RET call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret14=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L70] ~res~0 := #t~ret14; [L70] havoc #t~ret14; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] CALL call #t~ret15 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0] [L55] ~x := #in~x; [L55] #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] [L55] ensures true; VAL [#in~x=2.139095044E9, #NULL.base=0, #NULL.offset=0, #res=1, ~x=2.139095044E9] [L73] RET call #t~ret15 := isnan_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret15=1, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647; [L73] #t~short17 := 0 != #t~ret15; VAL [#NULL.base=0, #NULL.offset=0, #t~ret15=1, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume #t~short17; VAL [#NULL.base=0, #NULL.offset=0, #t~ret15=1, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] CALL call #t~ret16 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0] [L55] ~x := #in~x; [L55] #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] [L55] ensures true; VAL [#in~x=2.139095043E9, #NULL.base=0, #NULL.offset=0, #res=0, ~x=2.139095043E9] [L73] RET call #t~ret16 := isnan_float(~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret15=1, #t~ret16=0, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; [L73] #t~short17 := 0 == #t~ret16; VAL [#NULL.base=0, #NULL.offset=0, #t~ret15=1, #t~ret16=0, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73-L76] assume #t~short17 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0); [L73] havoc #t~ret15; [L73] havoc #t~ret16; [L73] havoc #t~short17; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] 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~ret21 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L64] ~x~0 := #t~nondet5; [L64] havoc #t~nondet5; [L65] ~y~0 := #t~nondet6; [L65] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] CALL call #t~ret7 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #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] [L67] RET call #t~ret7 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L67] #t~short9 := 0 != #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] COND TRUE #t~short9 VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] CALL call #t~ret8 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #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] [L67] RET call #t~ret8 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L67] #t~short9 := 0 == #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] #t~short13 := #t~short9; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short13=true, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] COND TRUE #t~short13 VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short13=true, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] COND TRUE #t~short13 [L67] havoc #t~ret8; [L68] havoc #t~short12; [L68] havoc #t~ret10; [L67] havoc #t~short9; [L67] havoc #t~ret7; [L68] havoc #t~ret11; [L67-L68] havoc #t~short13; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L70] CALL call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L43-L52] ~x := #in~x; [L43-L52] ~y := #in~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9, ~y=2.139095043E9] [L44] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L20-L41] ~x := #in~x; [L21] havoc ~w~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9] [L24] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L25] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L26] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L26] ~w~0 := #t~mem0; [L26] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L26] havoc #t~mem0; [L26] havoc #t~union1; [L24] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L24] havoc ~#gf_u~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L29] 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] [L31-L32] 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] [L34-L35] 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] [L37] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L40] #res := 0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L44] 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] [L44] 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] [L44] COND TRUE 0 == #t~ret2 [L44] havoc #t~ret2; [L45] #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] [L70] RET call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret14=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L70] ~res~0 := #t~ret14; [L70] havoc #t~ret14; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] CALL call #t~ret15 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #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] [L73] RET call #t~ret15 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647; [L73] #t~short17 := 0 != #t~ret15; VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] COND TRUE #t~short17 VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] CALL call #t~ret16 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #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] [L73] RET call #t~ret16 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~ret16=0, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; [L73] #t~short17 := 0 == #t~ret16; VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~ret16=0, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] COND TRUE #t~short17 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0) [L73] havoc #t~ret15; [L73] havoc #t~ret16; [L73] havoc #t~short17; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] 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~ret21 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L64] ~x~0 := #t~nondet5; [L64] havoc #t~nondet5; [L65] ~y~0 := #t~nondet6; [L65] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] CALL call #t~ret7 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #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] [L67] RET call #t~ret7 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L67] #t~short9 := 0 != #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] COND TRUE #t~short9 VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] CALL call #t~ret8 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #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] [L67] RET call #t~ret8 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L67] #t~short9 := 0 == #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] #t~short13 := #t~short9; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short13=true, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] COND TRUE #t~short13 VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short13=true, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] COND TRUE #t~short13 [L67] havoc #t~ret8; [L68] havoc #t~short12; [L68] havoc #t~ret10; [L67] havoc #t~short9; [L67] havoc #t~ret7; [L68] havoc #t~ret11; [L67-L68] havoc #t~short13; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L70] CALL call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L43-L52] ~x := #in~x; [L43-L52] ~y := #in~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9, ~y=2.139095043E9] [L44] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L20-L41] ~x := #in~x; [L21] havoc ~w~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9] [L24] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L25] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L26] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L26] ~w~0 := #t~mem0; [L26] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L26] havoc #t~mem0; [L26] havoc #t~union1; [L24] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L24] havoc ~#gf_u~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L29] 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] [L31-L32] 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] [L34-L35] 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] [L37] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L40] #res := 0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L44] 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] [L44] 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] [L44] COND TRUE 0 == #t~ret2 [L44] havoc #t~ret2; [L45] #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] [L70] RET call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret14=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L70] ~res~0 := #t~ret14; [L70] havoc #t~ret14; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] CALL call #t~ret15 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #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] [L73] RET call #t~ret15 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647; [L73] #t~short17 := 0 != #t~ret15; VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] COND TRUE #t~short17 VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] CALL call #t~ret16 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #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] [L73] RET call #t~ret16 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~ret16=0, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; [L73] #t~short17 := 0 == #t~ret16; VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~ret16=0, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] COND TRUE #t~short17 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0) [L73] havoc #t~ret15; [L73] havoc #t~ret16; [L73] havoc #t~short17; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] 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~ret21 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L64] ~x~0 := #t~nondet5; [L64] havoc #t~nondet5; [L65] ~y~0 := #t~nondet6; [L65] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] CALL call #t~ret7 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #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] [L67] RET call #t~ret7 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L67] #t~short9 := 0 != #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] COND TRUE #t~short9 VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] CALL call #t~ret8 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #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] [L67] RET call #t~ret8 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L67] #t~short9 := 0 == #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] #t~short13 := #t~short9; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short13=true, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] COND TRUE #t~short13 VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short13=true, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] COND TRUE #t~short13 [L67] havoc #t~ret8; [L68] havoc #t~short12; [L68] havoc #t~ret10; [L67] havoc #t~short9; [L67] havoc #t~ret7; [L68] havoc #t~ret11; [L67-L68] havoc #t~short13; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L70] CALL call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L43-L52] ~x := #in~x; [L43-L52] ~y := #in~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9, ~y=2.139095043E9] [L44] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L20-L41] ~x := #in~x; [L21] havoc ~w~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9] [L24] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L25] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L26] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L26] ~w~0 := #t~mem0; [L26] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L26] havoc #t~mem0; [L26] havoc #t~union1; [L24] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L24] havoc ~#gf_u~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L29] 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] [L31-L32] 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] [L34-L35] 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] [L37] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L40] #res := 0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L44] 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] [L44] 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] [L44] COND TRUE 0 == #t~ret2 [L44] havoc #t~ret2; [L45] #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] [L70] RET call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret14=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L70] ~res~0 := #t~ret14; [L70] havoc #t~ret14; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] CALL call #t~ret15 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #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] [L73] RET call #t~ret15 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647; [L73] #t~short17 := 0 != #t~ret15; VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] COND TRUE #t~short17 VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] CALL call #t~ret16 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #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] [L73] RET call #t~ret16 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~ret16=0, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; [L73] #t~short17 := 0 == #t~ret16; VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~ret16=0, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] COND TRUE #t~short17 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0) [L73] havoc #t~ret15; [L73] havoc #t~ret16; [L73] havoc #t~short17; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] 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~ret21 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L64] ~x~0 := #t~nondet5; [L64] havoc #t~nondet5; [L65] ~y~0 := #t~nondet6; [L65] havoc #t~nondet6; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] CALL call #t~ret7 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #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] [L67] RET call #t~ret7 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647; [L67] #t~short9 := 0 != #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] COND TRUE #t~short9 VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] CALL call #t~ret8 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #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] [L67] RET call #t~ret8 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; [L67] #t~short9 := 0 == #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] #t~short13 := #t~short9; VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short13=true, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] COND TRUE #t~short13 VAL [#NULL!base=0, #NULL!offset=0, #t~ret7=1, #t~ret8=0, #t~short13=true, #t~short9=true, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L67-L68] COND TRUE #t~short13 [L67] havoc #t~ret8; [L68] havoc #t~short12; [L68] havoc #t~ret10; [L67] havoc #t~short9; [L67] havoc #t~ret7; [L68] havoc #t~ret11; [L67-L68] havoc #t~short13; VAL [#NULL!base=0, #NULL!offset=0, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L70] CALL call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L43-L52] ~x := #in~x; [L43-L52] ~y := #in~y; VAL [#in~x=2.139095044E9, #in~y=2.139095043E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9, ~y=2.139095043E9] [L44] CALL call #t~ret2 := __fpclassify_float(~x); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L20-L41] ~x := #in~x; [L21] havoc ~w~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~x=2.139095044E9] [L24] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L25] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L26] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L26] ~w~0 := #t~mem0; [L26] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L26] havoc #t~mem0; [L26] havoc #t~union1; [L24] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L24] havoc ~#gf_u~0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, ~w~0=2139095041, ~x=2.139095044E9] [L29] 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] [L31-L32] 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] [L34-L35] 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] [L37] COND FALSE !(2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296) [L40] #res := 0; VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0, #res=0, ~w~0=2139095041, ~x=2.139095044E9] [L44] 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] [L44] 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] [L44] COND TRUE 0 == #t~ret2 [L44] havoc #t~ret2; [L45] #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] [L70] RET call #t~ret14 := fmax_float(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret14=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L70] ~res~0 := #t~ret14; [L70] havoc #t~ret14; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] CALL call #t~ret15 := isnan_float(~x~0); VAL [#in~x=2.139095044E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #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] [L73] RET call #t~ret15 := isnan_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume -2147483648 <= #t~ret15 && #t~ret15 <= 2147483647; [L73] #t~short17 := 0 != #t~ret15; VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] COND TRUE #t~short17 VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] CALL call #t~ret16 := isnan_float(~y~0); VAL [#in~x=2.139095043E9, #NULL!base=0, #NULL!offset=0] [L55] ~x := #in~x; [L55] #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] [L73] RET call #t~ret16 := isnan_float(~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~ret16=0, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] assume -2147483648 <= #t~ret16 && #t~ret16 <= 2147483647; [L73] #t~short17 := 0 == #t~ret16; VAL [#NULL!base=0, #NULL!offset=0, #t~ret15=1, #t~ret16=0, #t~short17=true, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L73] COND TRUE #t~short17 && ~someBinaryFLOATComparisonOperation(~res~0, ~y~0) [L73] havoc #t~ret15; [L73] havoc #t~ret16; [L73] havoc #t~short17; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L74] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=2.139095043E9, ~x~0=2.139095044E9, ~y~0=2.139095043E9] [L64] float x = __VERIFIER_nondet_float(); [L65] float y = __VERIFIER_nondet_float(); [L67] CALL, EXPR isnan_float(x) VAL [\old(x)=2139095044] [L55] return x != x; VAL [\old(x)=2139095044, \result=1, x=2139095044] [L67] RET, EXPR isnan_float(x) VAL [isnan_float(x)=1, x=2139095044, y=2139095043] [L67] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, x=2139095044, y=2139095043] [L67] CALL, EXPR isnan_float(y) VAL [\old(x)=2139095043] [L55] return x != x; VAL [\old(x)=2139095043, \result=0, x=2139095043] [L67] 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] [L67] 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] [L67-L68] (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] [L67-L68] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L70] CALL, EXPR fmax_float(x, y) VAL [\old(x)=2139095044, \old(y)=2139095043] [L44] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=2139095044] [L21] __uint32_t w; VAL [\old(x)=2139095044, x=2139095044] [L24] ieee_float_shape_type gf_u; [L25] gf_u.value = (x) [L26] EXPR gf_u.word [L26] (w) = gf_u.word [L29] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L31-L32] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L34-L35] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L37] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L40] return 0; VAL [\old(x)=2139095044, \result=0, w=2139095041, x=2139095044] [L44] RET, EXPR __fpclassify_float(x) VAL [\old(x)=2139095044, \old(y)=2139095043, __fpclassify_float(x)=0, x=2139095044, y=2139095043] [L44] COND TRUE __fpclassify_float(x) == 0 [L45] return y; VAL [\old(x)=2139095044, \old(y)=2139095043, \result=2139095043, x=2139095044, y=2139095043] [L70] RET, EXPR fmax_float(x, y) VAL [fmax_float(x, y)=2139095043, x=2139095044, y=2139095043] [L70] float res = fmax_float(x, y); [L73] CALL, EXPR isnan_float(x) VAL [\old(x)=2139095044] [L55] return x != x; VAL [\old(x)=2139095044, \result=1, x=2139095044] [L73] RET, EXPR isnan_float(x) VAL [isnan_float(x)=1, res=2139095043, x=2139095044, y=2139095043] [L73] 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] [L73] CALL, EXPR isnan_float(y) VAL [\old(x)=2139095043] [L55] return x != x; VAL [\old(x)=2139095043, \result=0, x=2139095043] [L73] 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] [L73] 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] [L73] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L74] __VERIFIER_error() VAL [res=2139095043, x=2139095044, y=2139095043] ----- [2018-11-23 15:42:28,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:42:28 BoogieIcfgContainer [2018-11-23 15:42:28,557 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 15:42:28,557 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:42:28,557 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:42:28,557 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:42:28,558 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:42:27" (3/4) ... [2018-11-23 15:42:28,561 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 15:42:28,561 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:42:28,561 INFO L168 Benchmark]: Toolchain (without parser) took 1260.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 959.2 MB in the beginning and 1.0 GB in the end (delta: -56.4 MB). Peak memory consumption was 81.0 MB. Max. memory is 11.5 GB. [2018-11-23 15:42:28,563 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:42:28,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.33 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:42:28,563 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.41 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:42:28,564 INFO L168 Benchmark]: Boogie Preprocessor took 58.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:42:28,564 INFO L168 Benchmark]: RCFGBuilder took 234.97 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.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-11-23 15:42:28,565 INFO L168 Benchmark]: TraceAbstraction took 766.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:42:28,565 INFO L168 Benchmark]: Witness Printer took 3.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:42:28,568 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 175.33 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 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 17.41 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 234.97 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.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 766.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 74]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 73. Possible FailurePath: [L64] float x = __VERIFIER_nondet_float(); [L65] float y = __VERIFIER_nondet_float(); [L67] CALL, EXPR isnan_float(x) VAL [\old(x)=2139095044] [L55] return x != x; VAL [\old(x)=2139095044, \result=1, x=2139095044] [L67] RET, EXPR isnan_float(x) VAL [isnan_float(x)=1, x=2139095044, y=2139095043] [L67] EXPR isnan_float(x) && !isnan_float(y) VAL [isnan_float(x)=1, isnan_float(x) && !isnan_float(y)=1, x=2139095044, y=2139095043] [L67] CALL, EXPR isnan_float(y) VAL [\old(x)=2139095043] [L55] return x != x; VAL [\old(x)=2139095043, \result=0, x=2139095043] [L67] 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] [L67] 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] [L67-L68] (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] [L67-L68] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L70] CALL, EXPR fmax_float(x, y) VAL [\old(x)=2139095044, \old(y)=2139095043] [L44] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=2139095044] [L21] __uint32_t w; VAL [\old(x)=2139095044, x=2139095044] [L24] ieee_float_shape_type gf_u; [L25] gf_u.value = (x) [L26] EXPR gf_u.word [L26] (w) = gf_u.word [L29] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L31-L32] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L34-L35] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=2139095044, w=2139095041, x=2139095044] [L37] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L40] return 0; VAL [\old(x)=2139095044, \result=0, w=2139095041, x=2139095044] [L44] RET, EXPR __fpclassify_float(x) VAL [\old(x)=2139095044, \old(y)=2139095043, __fpclassify_float(x)=0, x=2139095044, y=2139095043] [L44] COND TRUE __fpclassify_float(x) == 0 [L45] return y; VAL [\old(x)=2139095044, \old(y)=2139095043, \result=2139095043, x=2139095044, y=2139095043] [L70] RET, EXPR fmax_float(x, y) VAL [fmax_float(x, y)=2139095043, x=2139095044, y=2139095043] [L70] float res = fmax_float(x, y); [L73] CALL, EXPR isnan_float(x) VAL [\old(x)=2139095044] [L55] return x != x; VAL [\old(x)=2139095044, \result=1, x=2139095044] [L73] RET, EXPR isnan_float(x) VAL [isnan_float(x)=1, res=2139095043, x=2139095044, y=2139095043] [L73] 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] [L73] CALL, EXPR isnan_float(y) VAL [\old(x)=2139095043] [L55] return x != x; VAL [\old(x)=2139095043, \result=0, x=2139095043] [L73] 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] [L73] 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] [L73] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L74] __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 15:42:29,974 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:42:29,975 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:42:29,982 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:42:29,983 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:42:29,983 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:42:29,984 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:42:29,985 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:42:29,986 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:42:29,987 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:42:29,987 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:42:29,988 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:42:29,988 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:42:29,989 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:42:29,990 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:42:29,990 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:42:29,991 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:42:29,992 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:42:29,993 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:42:29,994 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:42:29,995 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:42:29,996 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:42:29,997 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:42:29,998 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:42:29,998 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:42:29,998 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:42:29,999 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:42:30,000 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:42:30,000 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:42:30,001 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:42:30,001 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:42:30,002 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:42:30,002 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:42:30,002 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:42:30,002 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:42:30,003 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:42:30,003 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 15:42:30,014 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:42:30,014 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:42:30,014 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:42:30,015 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:42:30,015 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 15:42:30,015 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 15:42:30,015 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 15:42:30,015 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 15:42:30,015 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 15:42:30,015 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 15:42:30,016 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:42:30,016 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:42:30,016 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:42:30,016 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:42:30,016 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 15:42:30,017 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:42:30,017 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 15:42:30,017 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 15:42:30,017 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 15:42:30,017 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:42:30,017 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:42:30,017 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:42:30,018 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 15:42:30,018 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:42:30,018 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:42:30,018 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:42:30,018 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:42:30,018 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:42:30,018 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:42:30,019 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:42:30,019 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 15:42:30,019 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 15:42:30,019 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:42:30,019 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 15:42:30,019 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 15:42:30,019 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_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 -> df3954142d6b55c98b13b60b9fbaf053d4d402ff [2018-11-23 15:42:30,049 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:42:30,057 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:42:30,059 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:42:30,060 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:42:30,060 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:42:30,060 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1251_true-unreach-call.c [2018-11-23 15:42:30,094 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/bin-2019/utaipan/data/489081938/b7c984e290964191a6efab421114af75/FLAGb87969269 [2018-11-23 15:42:30,486 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:42:30,486 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/sv-benchmarks/c/float-newlib/float_req_bl_1251_true-unreach-call.c [2018-11-23 15:42:30,490 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/bin-2019/utaipan/data/489081938/b7c984e290964191a6efab421114af75/FLAGb87969269 [2018-11-23 15:42:30,498 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/bin-2019/utaipan/data/489081938/b7c984e290964191a6efab421114af75 [2018-11-23 15:42:30,500 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:42:30,501 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:42:30,502 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:42:30,502 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:42:30,505 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:42:30,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:42:30" (1/1) ... [2018-11-23 15:42:30,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39fbe4e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:30, skipping insertion in model container [2018-11-23 15:42:30,508 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:42:30" (1/1) ... [2018-11-23 15:42:30,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:42:30,530 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:42:30,663 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:42:30,667 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:42:30,688 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:42:30,705 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:42:30,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:30 WrapperNode [2018-11-23 15:42:30,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:42:30,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:42:30,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:42:30,706 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:42:30,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:30" (1/1) ... [2018-11-23 15:42:30,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:30" (1/1) ... [2018-11-23 15:42:30,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:42:30,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:42:30,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:42:30,722 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:42:30,727 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:30" (1/1) ... [2018-11-23 15:42:30,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:30" (1/1) ... [2018-11-23 15:42:30,730 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:30" (1/1) ... [2018-11-23 15:42:30,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:30" (1/1) ... [2018-11-23 15:42:30,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:30" (1/1) ... [2018-11-23 15:42:30,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:30" (1/1) ... [2018-11-23 15:42:30,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:30" (1/1) ... [2018-11-23 15:42:30,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:42:30,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:42:30,744 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:42:30,744 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:42:30,745 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:30,840 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:42:30,840 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:42:30,841 INFO L130 BoogieDeclarations]: Found specification of procedure fmax_float [2018-11-23 15:42:30,841 INFO L138 BoogieDeclarations]: Found implementation of procedure fmax_float [2018-11-23 15:42:30,841 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2018-11-23 15:42:30,841 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2018-11-23 15:42:30,841 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2018-11-23 15:42:30,841 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2018-11-23 15:42:30,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:42:30,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:42:30,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:42:30,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 15:42:30,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:42:30,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:42:30,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-23 15:42:30,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:42:31,027 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 15:42:31,051 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:42:31,051 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 15:42:31,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:42:31 BoogieIcfgContainer [2018-11-23 15:42:31,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:42:31,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:42:31,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:42:31,054 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:42:31,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:42:30" (1/3) ... [2018-11-23 15:42:31,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2372db5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:42:31, skipping insertion in model container [2018-11-23 15:42:31,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:30" (2/3) ... [2018-11-23 15:42:31,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2372db5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:42:31, skipping insertion in model container [2018-11-23 15:42:31,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:42:31" (3/3) ... [2018-11-23 15:42:31,056 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251_true-unreach-call.c [2018-11-23 15:42:31,063 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:42:31,067 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-11-23 15:42:31,079 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-11-23 15:42:31,097 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:42:31,097 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:42:31,097 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 15:42:31,098 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:42:31,098 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:42:31,098 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:42:31,098 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:42:31,098 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:42:31,098 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:42:31,108 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-11-23 15:42:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 15:42:31,113 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:31,113 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 15:42:31,115 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:31,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:31,118 INFO L82 PathProgramCache]: Analyzing trace with hash 127161266, now seen corresponding path program 1 times [2018-11-23 15:42:31,121 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:31,121 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:31,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:31,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:31,200 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 15:42:31,200 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:42:31,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:42:31,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:42:31,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 15:42:31,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 15:42:31,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 15:42:31,220 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 2 states. [2018-11-23 15:42:31,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:31,238 INFO L93 Difference]: Finished difference Result 105 states and 146 transitions. [2018-11-23 15:42:31,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 15:42:31,239 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 35 [2018-11-23 15:42:31,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:31,245 INFO L225 Difference]: With dead ends: 105 [2018-11-23 15:42:31,245 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 15:42:31,247 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 15:42:31,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 15:42:31,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-23 15:42:31,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 15:42:31,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 78 transitions. [2018-11-23 15:42:31,283 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 78 transitions. Word has length 35 [2018-11-23 15:42:31,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:31,284 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 78 transitions. [2018-11-23 15:42:31,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 15:42:31,284 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 78 transitions. [2018-11-23 15:42:31,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 15:42:31,285 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:31,286 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 15:42:31,286 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:31,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:31,286 INFO L82 PathProgramCache]: Analyzing trace with hash -788283278, now seen corresponding path program 1 times [2018-11-23 15:42:31,286 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:31,287 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:31,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:31,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:31,359 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 15:42:31,359 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:42:31,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:42:31,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:42:31,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:42:31,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:42:31,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:42:31,367 INFO L87 Difference]: Start difference. First operand 59 states and 78 transitions. Second operand 4 states. [2018-11-23 15:42:31,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:31,416 INFO L93 Difference]: Finished difference Result 108 states and 143 transitions. [2018-11-23 15:42:31,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 15:42:31,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-23 15:42:31,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:31,418 INFO L225 Difference]: With dead ends: 108 [2018-11-23 15:42:31,418 INFO L226 Difference]: Without dead ends: 68 [2018-11-23 15:42:31,419 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 15:42:31,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-23 15:42:31,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2018-11-23 15:42:31,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 15:42:31,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2018-11-23 15:42:31,428 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 36 [2018-11-23 15:42:31,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:31,428 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2018-11-23 15:42:31,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:42:31,428 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2018-11-23 15:42:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 15:42:31,429 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:31,430 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 15:42:31,430 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:31,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:31,430 INFO L82 PathProgramCache]: Analyzing trace with hash -728340568, now seen corresponding path program 1 times [2018-11-23 15:42:31,431 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:31,431 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:31,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:31,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:31,515 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 15:42:31,516 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:42:31,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:42:31,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:42:31,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:42:31,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:42:31,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:42:31,523 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand 4 states. [2018-11-23 15:42:31,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:31,539 INFO L93 Difference]: Finished difference Result 86 states and 111 transitions. [2018-11-23 15:42:31,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:42:31,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-11-23 15:42:31,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:31,542 INFO L225 Difference]: With dead ends: 86 [2018-11-23 15:42:31,542 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 15:42:31,542 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 15:42:31,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 15:42:31,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-23 15:42:31,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 15:42:31,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2018-11-23 15:42:31,548 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 41 [2018-11-23 15:42:31,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:31,548 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2018-11-23 15:42:31,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:42:31,548 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2018-11-23 15:42:31,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 15:42:31,549 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:31,549 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 15:42:31,549 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:31,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:31,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1290130751, now seen corresponding path program 1 times [2018-11-23 15:42:31,550 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:31,550 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:31,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:31,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:31,607 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 15:42:31,607 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:42:31,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:42:31,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:42:31,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:42:31,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:42:31,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:42:31,615 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand 4 states. [2018-11-23 15:42:31,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:31,639 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2018-11-23 15:42:31,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:42:31,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-23 15:42:31,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:31,641 INFO L225 Difference]: With dead ends: 89 [2018-11-23 15:42:31,641 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 15:42:31,641 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 15:42:31,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 15:42:31,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2018-11-23 15:42:31,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 15:42:31,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2018-11-23 15:42:31,647 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 42 [2018-11-23 15:42:31,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:31,647 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2018-11-23 15:42:31,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:42:31,647 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2018-11-23 15:42:31,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 15:42:31,648 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:31,648 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 15:42:31,648 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:31,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:31,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1173472140, now seen corresponding path program 1 times [2018-11-23 15:42:31,648 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:31,648 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:31,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:31,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:31,726 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 15:42:31,726 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:42:31,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:42:31,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:42:31,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:42:31,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:42:31,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:42:31,734 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand 4 states. [2018-11-23 15:42:31,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:31,748 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2018-11-23 15:42:31,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:42:31,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-11-23 15:42:31,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:31,749 INFO L225 Difference]: With dead ends: 89 [2018-11-23 15:42:31,749 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 15:42:31,749 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 15:42:31,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 15:42:31,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2018-11-23 15:42:31,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 15:42:31,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2018-11-23 15:42:31,756 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 43 [2018-11-23 15:42:31,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:31,757 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2018-11-23 15:42:31,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:42:31,757 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2018-11-23 15:42:31,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 15:42:31,758 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:31,758 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 15:42:31,758 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:31,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:31,759 INFO L82 PathProgramCache]: Analyzing trace with hash -707704861, now seen corresponding path program 1 times [2018-11-23 15:42:31,759 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:31,759 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:31,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:31,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:31,802 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 15:42:31,803 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:42:31,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:42:31,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:42:31,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:42:31,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:42:31,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:42:31,810 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand 4 states. [2018-11-23 15:42:31,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:31,822 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2018-11-23 15:42:31,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:42:31,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-23 15:42:31,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:31,823 INFO L225 Difference]: With dead ends: 89 [2018-11-23 15:42:31,823 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 15:42:31,824 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 15:42:31,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 15:42:31,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2018-11-23 15:42:31,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 15:42:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2018-11-23 15:42:31,828 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 44 [2018-11-23 15:42:31,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:31,828 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2018-11-23 15:42:31,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:42:31,828 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2018-11-23 15:42:31,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 15:42:31,829 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:31,829 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 15:42:31,829 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:31,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:31,830 INFO L82 PathProgramCache]: Analyzing trace with hash 799846948, now seen corresponding path program 1 times [2018-11-23 15:42:31,830 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:31,830 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:31,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:31,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:31,993 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 15:42:31,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:42:32,200 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 15:42:32,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:42:32,207 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:32,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:32,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:32,258 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 15:42:32,258 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:42:32,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:42:32,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 9] total 14 [2018-11-23 15:42:32,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 15:42:32,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 15:42:32,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-11-23 15:42:32,274 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand 14 states. [2018-11-23 15:42:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:32,646 INFO L93 Difference]: Finished difference Result 105 states and 136 transitions. [2018-11-23 15:42:32,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 15:42:32,647 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-23 15:42:32,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:32,648 INFO L225 Difference]: With dead ends: 105 [2018-11-23 15:42:32,648 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 15:42:32,649 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 15:42:32,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 15:42:32,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2018-11-23 15:42:32,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-23 15:42:32,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 102 transitions. [2018-11-23 15:42:32,658 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 102 transitions. Word has length 44 [2018-11-23 15:42:32,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:32,659 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 102 transitions. [2018-11-23 15:42:32,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 15:42:32,659 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2018-11-23 15:42:32,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 15:42:32,659 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:32,660 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 15:42:32,660 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:32,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:32,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1433909297, now seen corresponding path program 1 times [2018-11-23 15:42:32,660 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:32,660 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:32,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:32,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:32,844 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 15:42:32,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:42:33,156 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 15:42:33,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:42:33,167 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:33,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:33,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:33,398 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 15:42:33,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:42:33,707 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 15:42:33,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:42:33,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 11, 11] total 29 [2018-11-23 15:42:33,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 15:42:33,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 15:42:33,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2018-11-23 15:42:33,722 INFO L87 Difference]: Start difference. First operand 77 states and 102 transitions. Second operand 29 states. [2018-11-23 15:42:35,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:35,575 INFO L93 Difference]: Finished difference Result 136 states and 179 transitions. [2018-11-23 15:42:35,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 15:42:35,576 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 49 [2018-11-23 15:42:35,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:35,577 INFO L225 Difference]: With dead ends: 136 [2018-11-23 15:42:35,577 INFO L226 Difference]: Without dead ends: 134 [2018-11-23 15:42:35,578 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 15:42:35,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-23 15:42:35,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 89. [2018-11-23 15:42:35,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 15:42:35,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2018-11-23 15:42:35,586 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 49 [2018-11-23 15:42:35,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:35,586 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2018-11-23 15:42:35,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 15:42:35,586 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2018-11-23 15:42:35,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 15:42:35,587 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:35,587 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 15:42:35,587 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:35,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:35,588 INFO L82 PathProgramCache]: Analyzing trace with hash -183164066, now seen corresponding path program 1 times [2018-11-23 15:42:35,588 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:35,588 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:35,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:35,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:35,688 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 15:42:35,688 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:42:35,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:42:35,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 15:42:35,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 15:42:35,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 15:42:35,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 15:42:35,696 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand 8 states. [2018-11-23 15:42:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:36,021 INFO L93 Difference]: Finished difference Result 158 states and 208 transitions. [2018-11-23 15:42:36,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 15:42:36,021 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-23 15:42:36,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:36,022 INFO L225 Difference]: With dead ends: 158 [2018-11-23 15:42:36,022 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 15:42:36,023 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 15:42:36,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 15:42:36,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 89. [2018-11-23 15:42:36,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 15:42:36,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2018-11-23 15:42:36,033 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 53 [2018-11-23 15:42:36,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:36,033 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2018-11-23 15:42:36,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 15:42:36,033 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2018-11-23 15:42:36,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 15:42:36,034 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:36,035 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 15:42:36,035 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:36,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:36,035 INFO L82 PathProgramCache]: Analyzing trace with hash 374913712, now seen corresponding path program 1 times [2018-11-23 15:42:36,035 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:36,035 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:36,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:36,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:36,139 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 15:42:36,140 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:42:36,297 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 15:42:36,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:42:36,304 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:36,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:36,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:36,351 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 15:42:36,351 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:42:36,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:42:36,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8, 9] total 13 [2018-11-23 15:42:36,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 15:42:36,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 15:42:36,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-11-23 15:42:36,366 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand 13 states. [2018-11-23 15:42:36,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:36,644 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2018-11-23 15:42:36,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 15:42:36,645 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 58 [2018-11-23 15:42:36,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:36,645 INFO L225 Difference]: With dead ends: 110 [2018-11-23 15:42:36,645 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 15:42:36,646 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 15:42:36,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 15:42:36,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 89. [2018-11-23 15:42:36,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 15:42:36,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 117 transitions. [2018-11-23 15:42:36,654 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 117 transitions. Word has length 58 [2018-11-23 15:42:36,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:36,654 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 117 transitions. [2018-11-23 15:42:36,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 15:42:36,654 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2018-11-23 15:42:36,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 15:42:36,655 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:36,655 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 15:42:36,656 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:36,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:36,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1241696182, now seen corresponding path program 1 times [2018-11-23 15:42:36,656 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:36,656 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:36,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:36,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:36,727 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 15:42:36,728 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:42:36,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:42:36,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:42:36,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:42:36,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:42:36,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:42:36,738 INFO L87 Difference]: Start difference. First operand 89 states and 117 transitions. Second operand 4 states. [2018-11-23 15:42:36,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:36,748 INFO L93 Difference]: Finished difference Result 119 states and 154 transitions. [2018-11-23 15:42:36,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:42:36,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-11-23 15:42:36,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:36,749 INFO L225 Difference]: With dead ends: 119 [2018-11-23 15:42:36,749 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 15:42:36,749 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 15:42:36,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 15:42:36,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-11-23 15:42:36,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 15:42:36,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. [2018-11-23 15:42:36,755 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 121 transitions. Word has length 61 [2018-11-23 15:42:36,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:36,755 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 121 transitions. [2018-11-23 15:42:36,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:42:36,756 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2018-11-23 15:42:36,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 15:42:36,756 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:36,756 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] [2018-11-23 15:42:36,756 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:36,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:36,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1403627392, now seen corresponding path program 1 times [2018-11-23 15:42:36,757 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:36,757 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:36,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:36,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:36,808 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 15:42:36,809 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:42:36,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:42:36,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:42:36,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:42:36,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:42:36,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:42:36,816 INFO L87 Difference]: Start difference. First operand 92 states and 121 transitions. Second operand 4 states. [2018-11-23 15:42:36,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:36,828 INFO L93 Difference]: Finished difference Result 122 states and 158 transitions. [2018-11-23 15:42:36,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:42:36,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-11-23 15:42:36,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:36,829 INFO L225 Difference]: With dead ends: 122 [2018-11-23 15:42:36,830 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 15:42:36,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 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 15:42:36,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 15:42:36,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-11-23 15:42:36,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 15:42:36,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. [2018-11-23 15:42:36,836 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 121 transitions. Word has length 55 [2018-11-23 15:42:36,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:36,836 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 121 transitions. [2018-11-23 15:42:36,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:42:36,836 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2018-11-23 15:42:36,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 15:42:36,837 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:36,837 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 15:42:36,837 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:36,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:36,838 INFO L82 PathProgramCache]: Analyzing trace with hash -342130789, now seen corresponding path program 1 times [2018-11-23 15:42:36,838 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:36,838 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:36,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:36,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:37,035 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 15:42:37,036 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:42:37,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:42:37,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 15:42:37,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 15:42:37,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 15:42:37,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:42:37,044 INFO L87 Difference]: Start difference. First operand 92 states and 121 transitions. Second operand 9 states. [2018-11-23 15:42:37,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:37,646 INFO L93 Difference]: Finished difference Result 147 states and 189 transitions. [2018-11-23 15:42:37,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 15:42:37,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2018-11-23 15:42:37,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:37,647 INFO L225 Difference]: With dead ends: 147 [2018-11-23 15:42:37,647 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 15:42:37,648 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 15:42:37,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 15:42:37,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 98. [2018-11-23 15:42:37,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 15:42:37,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 129 transitions. [2018-11-23 15:42:37,655 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 129 transitions. Word has length 63 [2018-11-23 15:42:37,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:37,655 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 129 transitions. [2018-11-23 15:42:37,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 15:42:37,656 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 129 transitions. [2018-11-23 15:42:37,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 15:42:37,656 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:37,657 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 15:42:37,657 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:37,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:37,657 INFO L82 PathProgramCache]: Analyzing trace with hash -235124114, now seen corresponding path program 1 times [2018-11-23 15:42:37,657 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:37,657 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:37,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:37,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:37,832 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 15:42:37,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:42:37,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:42:37,965 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:37,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:37,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:37,995 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 15:42:37,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:42:38,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:42:38,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-23 15:42:38,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 15:42:38,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 15:42:38,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:42:38,177 INFO L87 Difference]: Start difference. First operand 98 states and 129 transitions. Second operand 8 states. [2018-11-23 15:42:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:39,013 INFO L93 Difference]: Finished difference Result 134 states and 170 transitions. [2018-11-23 15:42:39,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 15:42:39,014 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-11-23 15:42:39,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:39,014 INFO L225 Difference]: With dead ends: 134 [2018-11-23 15:42:39,015 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 15:42:39,015 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 15:42:39,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 15:42:39,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 92. [2018-11-23 15:42:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-11-23 15:42:39,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 120 transitions. [2018-11-23 15:42:39,024 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 120 transitions. Word has length 56 [2018-11-23 15:42:39,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:39,024 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 120 transitions. [2018-11-23 15:42:39,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 15:42:39,025 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 120 transitions. [2018-11-23 15:42:39,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 15:42:39,025 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:39,025 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 15:42:39,026 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:39,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:39,026 INFO L82 PathProgramCache]: Analyzing trace with hash 2065698476, now seen corresponding path program 1 times [2018-11-23 15:42:39,026 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:39,026 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:39,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:39,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:39,245 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 15:42:39,245 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:42:39,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:42:39,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 15:42:39,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 15:42:39,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 15:42:39,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-23 15:42:39,253 INFO L87 Difference]: Start difference. First operand 92 states and 120 transitions. Second operand 11 states. [2018-11-23 15:42:39,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:39,943 INFO L93 Difference]: Finished difference Result 121 states and 156 transitions. [2018-11-23 15:42:39,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 15:42:39,943 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2018-11-23 15:42:39,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:39,944 INFO L225 Difference]: With dead ends: 121 [2018-11-23 15:42:39,944 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 15:42:39,944 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 15:42:39,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 15:42:39,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 97. [2018-11-23 15:42:39,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 15:42:39,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2018-11-23 15:42:39,952 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 126 transitions. Word has length 56 [2018-11-23 15:42:39,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:39,953 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 126 transitions. [2018-11-23 15:42:39,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 15:42:39,953 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2018-11-23 15:42:39,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 15:42:39,954 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:39,954 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 15:42:39,954 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:39,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:39,954 INFO L82 PathProgramCache]: Analyzing trace with hash -341505115, now seen corresponding path program 1 times [2018-11-23 15:42:39,954 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:39,955 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:39,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:39,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:39,999 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 15:42:39,999 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:42:40,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:42:40,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:42:40,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:42:40,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:42:40,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:42:40,007 INFO L87 Difference]: Start difference. First operand 97 states and 126 transitions. Second operand 4 states. [2018-11-23 15:42:40,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:40,021 INFO L93 Difference]: Finished difference Result 127 states and 163 transitions. [2018-11-23 15:42:40,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:42:40,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-11-23 15:42:40,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:40,022 INFO L225 Difference]: With dead ends: 127 [2018-11-23 15:42:40,022 INFO L226 Difference]: Without dead ends: 100 [2018-11-23 15:42:40,022 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 15:42:40,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-23 15:42:40,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-11-23 15:42:40,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 15:42:40,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2018-11-23 15:42:40,028 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 126 transitions. Word has length 56 [2018-11-23 15:42:40,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:40,029 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 126 transitions. [2018-11-23 15:42:40,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:42:40,029 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2018-11-23 15:42:40,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 15:42:40,029 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:40,030 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 15:42:40,030 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:40,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:40,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1176443467, now seen corresponding path program 1 times [2018-11-23 15:42:40,030 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:40,030 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:40,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:40,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:40,461 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 15:42:40,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:42:40,753 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2018-11-23 15:42:41,110 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-23 15:42:41,467 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2018-11-23 15:42:41,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:42:41,676 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:41,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:41,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:41,859 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 15:42:41,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:42:42,006 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2018-11-23 15:42:42,385 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-23 15:42:42,530 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2018-11-23 15:42:42,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:42:42,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 17 [2018-11-23 15:42:42,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 15:42:42,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 15:42:42,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-11-23 15:42:42,751 INFO L87 Difference]: Start difference. First operand 97 states and 126 transitions. Second operand 17 states. [2018-11-23 15:42:44,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:44,132 INFO L93 Difference]: Finished difference Result 154 states and 201 transitions. [2018-11-23 15:42:44,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 15:42:44,132 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2018-11-23 15:42:44,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:44,133 INFO L225 Difference]: With dead ends: 154 [2018-11-23 15:42:44,133 INFO L226 Difference]: Without dead ends: 127 [2018-11-23 15:42:44,133 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 15:42:44,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-23 15:42:44,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 109. [2018-11-23 15:42:44,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-23 15:42:44,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2018-11-23 15:42:44,142 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 143 transitions. Word has length 63 [2018-11-23 15:42:44,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:44,142 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 143 transitions. [2018-11-23 15:42:44,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 15:42:44,143 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 143 transitions. [2018-11-23 15:42:44,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 15:42:44,143 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:44,144 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 15:42:44,144 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:44,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:44,144 INFO L82 PathProgramCache]: Analyzing trace with hash -361444970, now seen corresponding path program 1 times [2018-11-23 15:42:44,144 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:44,144 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:44,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:44,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:44,279 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 15:42:44,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:42:44,481 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 15:42:44,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:42:44,488 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:44,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:44,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:44,551 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 15:42:44,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:42:44,688 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 15:42:44,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 15:42:44,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10, 12] total 17 [2018-11-23 15:42:44,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 15:42:44,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 15:42:44,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-11-23 15:42:44,704 INFO L87 Difference]: Start difference. First operand 109 states and 143 transitions. Second operand 17 states. [2018-11-23 15:42:45,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:45,281 INFO L93 Difference]: Finished difference Result 149 states and 192 transitions. [2018-11-23 15:42:45,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 15:42:45,282 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 64 [2018-11-23 15:42:45,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:45,283 INFO L225 Difference]: With dead ends: 149 [2018-11-23 15:42:45,283 INFO L226 Difference]: Without dead ends: 119 [2018-11-23 15:42:45,283 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 15:42:45,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-23 15:42:45,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 105. [2018-11-23 15:42:45,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 15:42:45,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 135 transitions. [2018-11-23 15:42:45,290 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 135 transitions. Word has length 64 [2018-11-23 15:42:45,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:45,291 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 135 transitions. [2018-11-23 15:42:45,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 15:42:45,291 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 135 transitions. [2018-11-23 15:42:45,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 15:42:45,291 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:45,291 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 15:42:45,292 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:45,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:45,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1339205341, now seen corresponding path program 1 times [2018-11-23 15:42:45,292 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:45,292 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:45,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:45,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:45,509 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 15:42:45,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:42:45,844 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 15:42:45,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:42:45,851 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:45,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:45,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:46,063 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 15:42:46,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:42:46,439 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 15:42:46,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2018-11-23 15:42:46,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 12, 12] total 31 [2018-11-23 15:42:46,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 15:42:46,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 15:42:46,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=824, Unknown=0, NotChecked=0, Total=930 [2018-11-23 15:42:46,455 INFO L87 Difference]: Start difference. First operand 105 states and 135 transitions. Second operand 31 states. [2018-11-23 15:42:48,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:48,269 INFO L93 Difference]: Finished difference Result 174 states and 224 transitions. [2018-11-23 15:42:48,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 15:42:48,269 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 57 [2018-11-23 15:42:48,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:48,270 INFO L225 Difference]: With dead ends: 174 [2018-11-23 15:42:48,270 INFO L226 Difference]: Without dead ends: 172 [2018-11-23 15:42:48,270 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 15:42:48,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-11-23 15:42:48,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 97. [2018-11-23 15:42:48,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-23 15:42:48,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2018-11-23 15:42:48,279 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 57 [2018-11-23 15:42:48,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:48,280 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2018-11-23 15:42:48,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 15:42:48,280 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2018-11-23 15:42:48,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 15:42:48,280 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:48,280 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 15:42:48,281 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:48,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:48,281 INFO L82 PathProgramCache]: Analyzing trace with hash -241334884, now seen corresponding path program 1 times [2018-11-23 15:42:48,281 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:48,281 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:48,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:48,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:48,328 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 15:42:48,328 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:42:48,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:42:48,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:42:48,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:42:48,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:42:48,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:42:48,336 INFO L87 Difference]: Start difference. First operand 97 states and 125 transitions. Second operand 4 states. [2018-11-23 15:42:48,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:48,350 INFO L93 Difference]: Finished difference Result 128 states and 162 transitions. [2018-11-23 15:42:48,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:42:48,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-11-23 15:42:48,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:48,350 INFO L225 Difference]: With dead ends: 128 [2018-11-23 15:42:48,351 INFO L226 Difference]: Without dead ends: 99 [2018-11-23 15:42:48,351 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 15:42:48,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-23 15:42:48,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-11-23 15:42:48,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 15:42:48,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions. [2018-11-23 15:42:48,357 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 57 [2018-11-23 15:42:48,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:48,357 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions. [2018-11-23 15:42:48,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:42:48,358 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2018-11-23 15:42:48,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 15:42:48,358 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:48,358 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 15:42:48,358 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:48,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:48,359 INFO L82 PathProgramCache]: Analyzing trace with hash -650159109, now seen corresponding path program 1 times [2018-11-23 15:42:48,359 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:48,359 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:48,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:48,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:48,846 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 15:42:48,846 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:42:48,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:42:48,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-23 15:42:48,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 15:42:48,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 15:42:48,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-11-23 15:42:48,854 INFO L87 Difference]: Start difference. First operand 95 states and 121 transitions. Second operand 15 states. [2018-11-23 15:42:49,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:49,997 INFO L93 Difference]: Finished difference Result 153 states and 199 transitions. [2018-11-23 15:42:49,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 15:42:49,998 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-11-23 15:42:49,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:49,998 INFO L225 Difference]: With dead ends: 153 [2018-11-23 15:42:49,999 INFO L226 Difference]: Without dead ends: 126 [2018-11-23 15:42:49,999 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 15:42:49,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-23 15:42:50,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 105. [2018-11-23 15:42:50,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 15:42:50,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 134 transitions. [2018-11-23 15:42:50,010 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 134 transitions. Word has length 57 [2018-11-23 15:42:50,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:50,011 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 134 transitions. [2018-11-23 15:42:50,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 15:42:50,011 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 134 transitions. [2018-11-23 15:42:50,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 15:42:50,012 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:50,012 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 15:42:50,012 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:50,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:50,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1123866972, now seen corresponding path program 1 times [2018-11-23 15:42:50,012 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:50,013 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:50,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:50,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:50,122 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 15:42:50,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:42:50,325 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 15:42:50,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:42:50,332 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:50,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:50,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:50,361 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 15:42:50,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:42:50,464 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 15:42:50,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 15:42:50,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8, 9] total 13 [2018-11-23 15:42:50,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 15:42:50,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 15:42:50,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-23 15:42:50,480 INFO L87 Difference]: Start difference. First operand 105 states and 134 transitions. Second operand 13 states. [2018-11-23 15:42:50,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:50,793 INFO L93 Difference]: Finished difference Result 174 states and 211 transitions. [2018-11-23 15:42:50,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 15:42:50,793 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 69 [2018-11-23 15:42:50,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:50,793 INFO L225 Difference]: With dead ends: 174 [2018-11-23 15:42:50,793 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 15:42:50,794 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 15:42:50,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 15:42:50,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2018-11-23 15:42:50,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 15:42:50,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2018-11-23 15:42:50,798 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 69 [2018-11-23 15:42:50,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:50,798 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2018-11-23 15:42:50,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 15:42:50,798 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2018-11-23 15:42:50,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 15:42:50,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:50,799 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 15:42:50,799 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:50,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:50,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1134884075, now seen corresponding path program 1 times [2018-11-23 15:42:50,800 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:50,800 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:50,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:50,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:50,910 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 15:42:50,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:42:51,144 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 15:42:51,331 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 15:42:51,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:42:51,338 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:51,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:51,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:51,400 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 15:42:51,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:42:51,575 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 15:42:51,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 15:42:51,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 10, 9] total 17 [2018-11-23 15:42:51,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 15:42:51,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 15:42:51,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-11-23 15:42:51,590 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand 17 states. [2018-11-23 15:42:51,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:51,946 INFO L93 Difference]: Finished difference Result 92 states and 110 transitions. [2018-11-23 15:42:51,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 15:42:51,946 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2018-11-23 15:42:51,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:51,947 INFO L225 Difference]: With dead ends: 92 [2018-11-23 15:42:51,947 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 15:42:51,947 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 15:42:51,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 15:42:51,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-11-23 15:42:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 15:42:51,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 66 transitions. [2018-11-23 15:42:51,950 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 66 transitions. Word has length 61 [2018-11-23 15:42:51,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:51,950 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 66 transitions. [2018-11-23 15:42:51,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 15:42:51,950 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 66 transitions. [2018-11-23 15:42:51,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 15:42:51,951 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:51,951 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 15:42:51,951 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:51,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:51,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1573046304, now seen corresponding path program 1 times [2018-11-23 15:42:51,952 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:51,952 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:51,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:52,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:52,197 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 15:42:52,197 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:42:52,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:42:52,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 15:42:52,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 15:42:52,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 15:42:52,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 15:42:52,204 INFO L87 Difference]: Start difference. First operand 56 states and 66 transitions. Second operand 12 states. [2018-11-23 15:42:52,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:52,900 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2018-11-23 15:42:52,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 15:42:52,901 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-23 15:42:52,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:52,901 INFO L225 Difference]: With dead ends: 79 [2018-11-23 15:42:52,902 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 15:42:52,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 15:42:52,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 15:42:52,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 15:42:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 15:42:52,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2018-11-23 15:42:52,905 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 70 [2018-11-23 15:42:52,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:52,905 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2018-11-23 15:42:52,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 15:42:52,905 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2018-11-23 15:42:52,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 15:42:52,906 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:52,906 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 15:42:52,906 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:52,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:52,906 INFO L82 PathProgramCache]: Analyzing trace with hash -193580157, now seen corresponding path program 1 times [2018-11-23 15:42:52,907 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:52,907 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:52,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:52,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:53,157 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 15:42:53,157 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:42:53,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:42:53,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 15:42:53,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 15:42:53,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 15:42:53,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 15:42:53,165 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 12 states. [2018-11-23 15:42:53,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:53,810 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2018-11-23 15:42:53,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 15:42:53,811 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-11-23 15:42:53,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:53,812 INFO L225 Difference]: With dead ends: 81 [2018-11-23 15:42:53,812 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 15:42:53,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 15:42:53,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 15:42:53,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-23 15:42:53,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 15:42:53,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2018-11-23 15:42:53,815 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 71 [2018-11-23 15:42:53,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:53,815 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2018-11-23 15:42:53,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 15:42:53,815 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2018-11-23 15:42:53,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 15:42:53,816 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:53,816 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 15:42:53,816 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:53,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:53,816 INFO L82 PathProgramCache]: Analyzing trace with hash 997969323, now seen corresponding path program 1 times [2018-11-23 15:42:53,816 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:53,816 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:53,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:53,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:53,987 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 15:42:53,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:42:54,534 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 15:42:54,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:42:54,542 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:54,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:54,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:54,902 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 15:42:54,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 15:42:55,455 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 15:42:55,561 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 15:42:55,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-23 15:42:55,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12, 13] total 34 [2018-11-23 15:42:55,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 15:42:55,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 15:42:55,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 15:42:55,577 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 34 states. [2018-11-23 15:42:56,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:56,835 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2018-11-23 15:42:56,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 15:42:56,835 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 71 [2018-11-23 15:42:56,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:56,836 INFO L225 Difference]: With dead ends: 97 [2018-11-23 15:42:56,836 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 15:42:56,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 248 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=203, Invalid=1437, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 15:42:56,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 15:42:56,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 57. [2018-11-23 15:42:56,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 15:42:56,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2018-11-23 15:42:56,840 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 71 [2018-11-23 15:42:56,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:56,840 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2018-11-23 15:42:56,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 15:42:56,840 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2018-11-23 15:42:56,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 15:42:56,840 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:56,841 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 15:42:56,841 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:56,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:56,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1902363068, now seen corresponding path program 1 times [2018-11-23 15:42:56,841 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:56,841 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:56,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:56,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:57,145 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 15:42:57,145 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:42:57,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:42:57,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 15:42:57,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 15:42:57,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 15:42:57,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 15:42:57,157 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 12 states. [2018-11-23 15:42:57,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:57,910 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2018-11-23 15:42:57,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 15:42:57,910 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2018-11-23 15:42:57,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:57,911 INFO L225 Difference]: With dead ends: 80 [2018-11-23 15:42:57,911 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 15:42:57,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-23 15:42:57,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 15:42:57,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-11-23 15:42:57,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 15:42:57,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2018-11-23 15:42:57,914 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 72 [2018-11-23 15:42:57,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:57,914 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2018-11-23 15:42:57,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 15:42:57,914 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2018-11-23 15:42:57,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 15:42:57,914 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:57,914 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 15:42:57,914 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:57,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:57,915 INFO L82 PathProgramCache]: Analyzing trace with hash -562618969, now seen corresponding path program 1 times [2018-11-23 15:42:57,915 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:57,915 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:57,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:57,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:58,106 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 15:42:58,106 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:42:58,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:42:58,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 15:42:58,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 15:42:58,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 15:42:58,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 15:42:58,114 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 12 states. [2018-11-23 15:42:58,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:58,681 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2018-11-23 15:42:58,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 15:42:58,681 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2018-11-23 15:42:58,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:58,682 INFO L225 Difference]: With dead ends: 78 [2018-11-23 15:42:58,682 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 15:42:58,682 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 15:42:58,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 15:42:58,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-11-23 15:42:58,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 15:42:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-11-23 15:42:58,684 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 73 [2018-11-23 15:42:58,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:58,685 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-11-23 15:42:58,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 15:42:58,685 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-11-23 15:42:58,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-23 15:42:58,685 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:42:58,685 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 15:42:58,685 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:42:58,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:42:58,686 INFO L82 PathProgramCache]: Analyzing trace with hash 130482728, now seen corresponding path program 1 times [2018-11-23 15:42:58,686 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:42:58,686 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/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 15:42:58,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:42:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:42:58,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:42:58,744 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 15:42:58,744 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:42:58,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:42:58,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 15:42:58,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 15:42:58,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 15:42:58,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 15:42:58,757 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 4 states. [2018-11-23 15:42:58,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:42:58,778 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2018-11-23 15:42:58,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:42:58,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-11-23 15:42:58,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:42:58,780 INFO L225 Difference]: With dead ends: 58 [2018-11-23 15:42:58,780 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 15:42:58,780 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 15:42:58,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 15:42:58,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 15:42:58,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 15:42:58,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 15:42:58,781 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 73 [2018-11-23 15:42:58,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:42:58,781 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:42:58,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 15:42:58,781 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 15:42:58,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 15:42:58,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 15:42:58,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:42:58,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-23 15:42:59,224 INFO L448 ceAbstractionStarter]: For program point isnan_floatFINAL(line 55) no Hoare annotation was computed. [2018-11-23 15:42:59,224 INFO L451 ceAbstractionStarter]: At program point isnan_floatENTRY(line 55) the Hoare annotation is: true [2018-11-23 15:42:59,224 INFO L448 ceAbstractionStarter]: For program point isnan_floatEXIT(line 55) no Hoare annotation was computed. [2018-11-23 15:42:59,224 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 15:42:59,224 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 15:42:59,224 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 15:42:59,224 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 15:42:59,224 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 15:42:59,225 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 15:42:59,225 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 15:42:59,225 INFO L444 ceAbstractionStarter]: At program point L68-3(line 68) the Hoare annotation is: (and (not |main_#t~short9|) (not |main_#t~short13|) (fp.eq main_~x~0 main_~x~0) (= (_ bv0 32) |main_#t~ret7|) (= |main_#t~ret10| (_ bv0 32)) |main_#t~short12|) [2018-11-23 15:42:59,225 INFO L448 ceAbstractionStarter]: For program point L68-4(line 68) no Hoare annotation was computed. [2018-11-23 15:42:59,225 INFO L448 ceAbstractionStarter]: For program point L68-6(line 68) no Hoare annotation was computed. [2018-11-23 15:42:59,225 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 74) no Hoare annotation was computed. [2018-11-23 15:42:59,225 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 57 86) no Hoare annotation was computed. [2018-11-23 15:42:59,225 INFO L444 ceAbstractionStarter]: At program point L73(line 73) the Hoare annotation is: (or (and (= main_~x~0 main_~res~0) (not (fp.eq main_~y~0 main_~y~0))) (and (= main_~y~0 main_~res~0) (not (fp.eq main_~x~0 main_~x~0)))) [2018-11-23 15:42:59,225 INFO L448 ceAbstractionStarter]: For program point L73-1(line 73) no Hoare annotation was computed. [2018-11-23 15:42:59,225 INFO L448 ceAbstractionStarter]: For program point L73-2(line 73) no Hoare annotation was computed. [2018-11-23 15:42:59,225 INFO L444 ceAbstractionStarter]: At program point L73-3(line 73) the Hoare annotation is: (and |main_#t~short17| (= main_~y~0 main_~res~0) (= (_ bv1 32) |main_#t~ret15|) (not (fp.eq main_~x~0 main_~x~0))) [2018-11-23 15:42:59,225 INFO L448 ceAbstractionStarter]: For program point L73-4(line 73) no Hoare annotation was computed. [2018-11-23 15:42:59,225 INFO L448 ceAbstractionStarter]: For program point L73-6(lines 73 76) no Hoare annotation was computed. [2018-11-23 15:42:59,226 INFO L448 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2018-11-23 15:42:59,226 INFO L444 ceAbstractionStarter]: At program point L70(line 70) 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 15:42:59,226 INFO L448 ceAbstractionStarter]: For program point L70-1(line 70) no Hoare annotation was computed. [2018-11-23 15:42:59,226 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-11-23 15:42:59,226 INFO L444 ceAbstractionStarter]: At program point L79(line 79) 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 15:42:59,226 INFO L448 ceAbstractionStarter]: For program point L79-1(line 79) no Hoare annotation was computed. [2018-11-23 15:42:59,226 INFO L448 ceAbstractionStarter]: For program point L79-2(line 79) no Hoare annotation was computed. [2018-11-23 15:42:59,226 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 57 86) no Hoare annotation was computed. [2018-11-23 15:42:59,226 INFO L444 ceAbstractionStarter]: At program point L79-3(line 79) the Hoare annotation is: (and (= main_~x~0 main_~res~0) (fp.eq main_~x~0 main_~x~0) |main_#t~short20| (not (fp.eq main_~y~0 main_~y~0))) [2018-11-23 15:42:59,226 INFO L448 ceAbstractionStarter]: For program point L79-4(line 79) no Hoare annotation was computed. [2018-11-23 15:42:59,226 INFO L448 ceAbstractionStarter]: For program point L79-6(lines 79 82) no Hoare annotation was computed. [2018-11-23 15:42:59,226 INFO L451 ceAbstractionStarter]: At program point L67(line 67) the Hoare annotation is: true [2018-11-23 15:42:59,226 INFO L448 ceAbstractionStarter]: For program point L67-1(line 67) no Hoare annotation was computed. [2018-11-23 15:42:59,227 INFO L448 ceAbstractionStarter]: For program point L67-2(line 67) no Hoare annotation was computed. [2018-11-23 15:42:59,227 INFO L444 ceAbstractionStarter]: At program point L67-3(line 67) the Hoare annotation is: (and (= (_ bv1 32) |main_#t~ret7|) |main_#t~short9| (not (fp.eq main_~x~0 main_~x~0))) [2018-11-23 15:42:59,227 INFO L448 ceAbstractionStarter]: For program point L67-4(line 67) no Hoare annotation was computed. [2018-11-23 15:42:59,227 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 57 86) the Hoare annotation is: true [2018-11-23 15:42:59,227 INFO L448 ceAbstractionStarter]: For program point L67-6(line 67) no Hoare annotation was computed. [2018-11-23 15:42:59,227 INFO L448 ceAbstractionStarter]: For program point L67-7(lines 67 68) no Hoare annotation was computed. [2018-11-23 15:42:59,227 INFO L448 ceAbstractionStarter]: For program point L67-9(lines 67 83) no Hoare annotation was computed. [2018-11-23 15:42:59,227 INFO L448 ceAbstractionStarter]: For program point L67-11(lines 67 83) no Hoare annotation was computed. [2018-11-23 15:42:59,227 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-23 15:42:59,227 INFO L444 ceAbstractionStarter]: At program point L68(line 68) the Hoare annotation is: (let ((.cse2 (fp.eq main_~x~0 main_~x~0)) (.cse0 (not |main_#t~short9|)) (.cse1 (not |main_#t~short13|))) (or (and .cse0 .cse1 .cse2 (= (_ bv0 32) |main_#t~ret7|)) (and (and (= (_ bv1 32) |main_#t~ret7|) (not .cse2)) (= (bvadd |main_#t~ret8| (_ bv4294967295 32)) (_ bv0 32)) .cse0 .cse1 (not (fp.eq main_~y~0 main_~y~0))))) [2018-11-23 15:42:59,227 INFO L448 ceAbstractionStarter]: For program point L68-1(line 68) no Hoare annotation was computed. [2018-11-23 15:42:59,227 INFO L448 ceAbstractionStarter]: For program point L68-2(line 68) no Hoare annotation was computed. [2018-11-23 15:42:59,227 INFO L448 ceAbstractionStarter]: For program point fmax_floatEXIT(lines 43 52) no Hoare annotation was computed. [2018-11-23 15:42:59,227 INFO L451 ceAbstractionStarter]: At program point fmax_floatENTRY(lines 43 52) the Hoare annotation is: true [2018-11-23 15:42:59,227 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-23 15:42:59,228 INFO L448 ceAbstractionStarter]: For program point L51-2(line 51) no Hoare annotation was computed. [2018-11-23 15:42:59,228 INFO L444 ceAbstractionStarter]: At program point L48(line 48) the Hoare annotation is: (and (= |fmax_float_#in~y| fmax_float_~y) (= |fmax_float_#in~x| fmax_float_~x)) [2018-11-23 15:42:59,228 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 48 50) no Hoare annotation was computed. [2018-11-23 15:42:59,228 INFO L444 ceAbstractionStarter]: At program point L44(line 44) the Hoare annotation is: (and (= |fmax_float_#in~y| fmax_float_~y) (= |fmax_float_#in~x| fmax_float_~x)) [2018-11-23 15:42:59,228 INFO L448 ceAbstractionStarter]: For program point L44-1(lines 44 46) no Hoare annotation was computed. [2018-11-23 15:42:59,228 INFO L448 ceAbstractionStarter]: For program point fmax_floatFINAL(lines 43 52) no Hoare annotation was computed. [2018-11-23 15:42:59,228 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 40) no Hoare annotation was computed. [2018-11-23 15:42:59,228 INFO L448 ceAbstractionStarter]: For program point __fpclassify_floatFINAL(lines 20 41) no Hoare annotation was computed. [2018-11-23 15:42:59,228 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 23 27) no Hoare annotation was computed. [2018-11-23 15:42:59,228 INFO L444 ceAbstractionStarter]: At program point L23-2(lines 23 27) the Hoare annotation is: (= __fpclassify_float_~x |__fpclassify_float_#in~x|) [2018-11-23 15:42:59,228 INFO L448 ceAbstractionStarter]: For program point L23-3(lines 20 41) no Hoare annotation was computed. [2018-11-23 15:42:59,228 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 40) no Hoare annotation was computed. [2018-11-23 15:42:59,228 INFO L451 ceAbstractionStarter]: At program point __fpclassify_floatENTRY(lines 20 41) the Hoare annotation is: true [2018-11-23 15:42:59,228 INFO L448 ceAbstractionStarter]: For program point __fpclassify_floatEXIT(lines 20 41) no Hoare annotation was computed. [2018-11-23 15:42:59,229 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 40) no Hoare annotation was computed. [2018-11-23 15:42:59,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:42:59 BoogieIcfgContainer [2018-11-23 15:42:59,239 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 15:42:59,239 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:42:59,239 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:42:59,239 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:42:59,240 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:42:31" (3/4) ... [2018-11-23 15:42:59,242 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 15:42:59,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure isnan_float [2018-11-23 15:42:59,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 15:42:59,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 15:42:59,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fmax_float [2018-11-23 15:42:59,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2018-11-23 15:42:59,253 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2018-11-23 15:42:59,253 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-23 15:42:59,253 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 15:42:59,270 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: x == \old(x) [2018-11-23 15:42:59,288 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bea03a69-bb94-4c3a-b644-8d88d0e365f5/bin-2019/utaipan/witness.graphml [2018-11-23 15:42:59,288 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:42:59,289 INFO L168 Benchmark]: Toolchain (without parser) took 28787.87 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 384.3 MB). Free memory was 953.2 MB in the beginning and 830.5 MB in the end (delta: 122.7 MB). Peak memory consumption was 507.0 MB. Max. memory is 11.5 GB. [2018-11-23 15:42:59,289 INFO L168 Benchmark]: CDTParser took 0.11 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 15:42:59,289 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.86 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 15:42:59,289 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.83 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:42:59,289 INFO L168 Benchmark]: Boogie Preprocessor took 21.80 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:42:59,290 INFO L168 Benchmark]: RCFGBuilder took 308.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:42:59,290 INFO L168 Benchmark]: TraceAbstraction took 28186.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 246.4 MB). Free memory was 1.1 GB in the beginning and 841.7 MB in the end (delta: 262.9 MB). Peak memory consumption was 509.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:42:59,290 INFO L168 Benchmark]: Witness Printer took 48.92 ms. Allocated memory is still 1.4 GB. Free memory was 841.7 MB in the beginning and 830.5 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 11.5 GB. [2018-11-23 15:42:59,291 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.11 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 203.86 ms. Allocated memory is still 1.0 GB. Free memory was 953.2 MB in the beginning and 937.1 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 15.83 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.80 ms. Allocated memory is still 1.0 GB. Free memory is still 937.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 308.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -167.5 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28186.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 246.4 MB). Free memory was 1.1 GB in the beginning and 841.7 MB in the end (delta: 262.9 MB). Peak memory consumption was 509.4 MB. Max. memory is 11.5 GB. * Witness Printer took 48.92 ms. Allocated memory is still 1.4 GB. Free memory was 841.7 MB in the beginning and 830.5 MB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 74]: 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: 23]: Loop Invariant Derived loop invariant: x == \old(x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 64 locations, 2 error locations. SAFE Result, 28.1s OverallTime, 29 OverallIterations, 6 TraceHistogramMax, 14.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 2002 SDtfs, 1256 SDslu, 12561 SDs, 0 SdLazy, 6758 SolverSat, 433 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3273 GetRequests, 2872 SyntacticMatches, 10 SemanticMatches, 391 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1448 ImplicationChecksByTransitivity, 10.2s 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.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 345 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 169 PreInvPairs, 193 NumberOfFragments, 154 HoareAnnotationTreeSize, 169 FomulaSimplifications, 31128 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 19 FomulaSimplificationsInter, 74 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 2242 NumberOfCodeBlocks, 2242 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3033 ConstructedInterpolants, 35 QuantifiedInterpolants, 557484 SizeOfPredicates, 188 NumberOfNonLiveVariables, 4706 ConjunctsInSsa, 401 ConjunctsInUnsatCore, 53 InterpolantComputations, 23 PerfectInterpolantSequences, 1474/1662 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...